On the Generalized Spectral Characterizations of Eulerian Graphs
Keyword(s):
A graph $G$ is said to be determined by its generalized spectra (DGS for short) if, for any graph $H$, graphs $H$ and $G$ are cospectral with cospectral complements imply that $H$ is isomorphic to $G$. In Wang (J. Combin. Theory, Ser. B, 122 (2017) 438-451), the author gave a simple method for a graph to be DGS. However, the method does not apply to Eulerian graphs. In this paper, we gave a simple method for a large family of Eulerian graphs to be DGS. Numerical experiments are also presented to illustrate the effectiveness of the proposed method.
Keyword(s):
2010 ◽
Vol 18
(01)
◽
pp. 1-11
◽
Keyword(s):
1978 ◽
Vol 36
(1)
◽
pp. 226-227
1981 ◽
Vol 39
◽
pp. 550-551
Keyword(s):