On the generalized spectral characterizations of Eulerian graphs
From MaRDI portal
Publication:668057
zbMath1409.05130MaRDI QIDQ668057
Wei Wang, Yizhe Ji, Lihong Qiu
Publication date: 5 March 2019
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v26i1p9
Related Items (5)
Generalized spectral characterization of mixed graphs ⋮ On the Smith normal form of walk matrices ⋮ Constructing cospectral graphs via regular rational orthogonal matrices with level two ⋮ Smith normal form and the generalized spectral characterization of graphs ⋮ An improved condition for a graph to be determined by its generalized spectrum
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple arithmetic criterion for graphs being determined by their generalized spectra
- Generalized spectral characterization of graphs revisited
- An excluding algorithm for testing whether a family of graphs are determined by their generalized spectra
- Developments on spectral characterizations of graphs
- Which graphs are determined by their spectrum?
- Controllable subsets in graphs
- A sufficient condition for a family of graphs being determined by their generalized spectra
- On a Conjecture of Godsil Concerning Controllable Random Graphs
- Graph isomorphism in quasipolynomial time [extended abstract]
- Can One Hear the Shape of a Drum?
- On hearing the shape of a drum
This page was built for publication: On the generalized spectral characterizations of Eulerian graphs
