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.
@article{10_37236_8257,
author = {Lihong Qiu and Yizhe Ji and Wei Wang},
title = {On the generalized spectral characterizations of {Eulerian} graphs},
journal = {The electronic journal of combinatorics},
year = {2019},
volume = {26},
number = {1},
doi = {10.37236/8257},
zbl = {1409.05130},
url = {http://geodesic.mathdoc.fr/articles/10.37236/8257/}
}
TY - JOUR
AU - Lihong Qiu
AU - Yizhe Ji
AU - Wei Wang
TI - On the generalized spectral characterizations of Eulerian graphs
JO - The electronic journal of combinatorics
PY - 2019
VL - 26
IS - 1
UR - http://geodesic.mathdoc.fr/articles/10.37236/8257/
DO - 10.37236/8257
ID - 10_37236_8257
ER -
%0 Journal Article
%A Lihong Qiu
%A Yizhe Ji
%A Wei Wang
%T On the generalized spectral characterizations of Eulerian graphs
%J The electronic journal of combinatorics
%D 2019
%V 26
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/8257/
%R 10.37236/8257
%F 10_37236_8257
Lihong Qiu; Yizhe Ji; Wei Wang. On the generalized spectral characterizations of Eulerian graphs. The electronic journal of combinatorics, Tome 26 (2019) no. 1. doi: 10.37236/8257
