Spectral characterization of the complete graph removing a path of small length

Lihuan Mao, Sebastian M. Cioabă, Wei Wang

A graph $G$ is said to be \emph{determined by its spectrum} if any graph having the same spectrum as $G$ is isomorphic to $G$. Let $K_n\setminus P_{\ell }$ be the graph obtained fr…