Name
Abstract | ||
|---|---|---|
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 [16] (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 give 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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.37236/8257 | ELECTRONIC JOURNAL OF COMBINATORICS |
Field | DocType | Volume |
Discrete mathematics,Graph,Eulerian path,Mathematics | Journal | 26 |
Issue | ISSN | Citations |
1 | 1077-8926 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lihong Qiu | 1 | 0 | 0.34 |
| Yizhe Ji | 2 | 0 | 0.34 |
| Wei Wang | 3 | 81 | 12.64 |