A new arithmetic criterion for graphs being determined by their generalized \(Q\)-spectrum
From MaRDI portal
Publication:2317643
DOI10.1016/j.disc.2018.08.008zbMath1417.05123OpenAlexW2889257154MaRDI QIDQ2317643
Wei Wang, Yizhe Ji, Lihong Qiu
Publication date: 12 August 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2018.08.008
Related Items (11)
On the generalized \(A_\alpha\)-spectral characterizations of almost \(\alpha\)-controllable graphs ⋮ A new criterion for almost controllable graphs being determined by their generalized spectra ⋮ Generalized spectral characterizations of regular graphs based on graph-vectors ⋮ Smith normal form and the generalized spectral characterization of oriented graphs ⋮ Construction of graphs with distinct \(A_\alpha \)-eigenvalues ⋮ Generalized spectral characterization of mixed graphs ⋮ On the Smith normal form of walk matrices ⋮ An arithmetic criterion for graphs being determined by their generalized \(A_\alpha \)-spectra ⋮ Generalized spectral characterizations of almost controllable graphs ⋮ 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
- A simple arithmetic criterion for graphs being determined by their generalized spectra
- Generalized spectral characterization of graphs revisited
- On a signless Laplacian spectral characterization of \(T\)-shape trees
- An excluding algorithm for testing whether a family of graphs are determined by their generalized spectra
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- Developments on spectral characterizations of graphs
- The lollipop graph is determined by its \(Q\)-spectrum
- Which graphs are determined by their spectrum?
- A sufficient condition for a family of graphs being determined by their generalized spectra
- Signless Laplacian spectral characterization of 4-rose graphs
- Towards a spectral theory of graphs based on the signless Laplacian, I
- Towards a spectral theory of graphs based on the signless Laplacian, III
- 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: A new arithmetic criterion for graphs being determined by their generalized \(Q\)-spectrum