3 problems

Let $G$ be a connected graph of order $n\geq 3$, and let $\mu(G)$ denote its Mycielskian graph. Write $\operatorname{Dist}(G)$ for the distinguishing number and…

Alikhani–Soltani's conjecture. For all but a finite number of connected graphs $G$ with at least three vertices,

Circular altitude conjecture.