3 problems

Lin et al.'s conjecture. The complete $k$-partite graph $K_{n_{1},n_{2},\ldots,n_{k}}$ is determined by its $D$-spectrum.

Let $G$ be a complete $k$-partite graph, and let $e$ be an edge of $G$ such that $G\backslash\{e\}$ remains connected. The distance energy of a graph is the sum of the absolute val…

AutoGraphiX conjecture.