Generalized Spectral Characterization of Graphs: Revisited

Abstract

A graph $G$ is said to be \textit{determined by its generalized spectrum} (DGS for short) if for any graph $H$, $H$ and $G$ are cospectral with cospectral complements implies that $H$ is isomorphic to $G$. In \cite{WX,WX1}, Wang and Xu gave some methods for determining whether a family of graphs are DGS. In this paper, we shall review some of the old results and present some new ones along this line of research.

13 pages

References in corpus (1)

• Controllable Subsets in Graphs

Cited by in corpus (1)

• Distinguishing graphs with zeta functions and generalized spectra