Irena M. Jovanović

Resolutions of two conjectures on the spectral diameter

Let $\lambda_1(G) \geq \dots \geq \lambda_n(G)$ be the adjacency spectrum of a graph $G$ on $n$ vertices. The spectral distance $\sigma(G,H)$ between $n$-vertex graphs $G$ and $H$ is the Manhattan distance between their spectra, i.e. $\sigma(G,H) = \sum_{i=1}^n |\lambda_i(G) - \lambda_i(H)|$. Given a set $\mathcal{G}$...