A new arithmetic criterion for graphs being determined by their generalized Q-spectrum
From MaRDI portal
Publication:2317643
DOI10.1016/J.DISC.2018.08.008zbMATH Open1417.05123OpenAlexW2889257154MaRDI QIDQ2317643FDOQ2317643
Authors: Lihong Qiu, Yizhe Ji, Wei Wang 
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
Recommendations
- A simple arithmetic criterion for graphs being determined by their generalized spectra
- Generalized spectral characterization of graphs revisited
- A sufficient condition for a family of graphs being determined by their generalized spectra
- An improved condition for a graph to be determined by its generalized spectrum
- An arithmetic criterion for graphs being determined by their generalized \(A_\alpha \)-spectra
Cites Work
- Towards a spectral theory of graphs based on the signless Laplacian, III
- Developments on spectral characterizations of graphs
- Which graphs are determined by their spectrum?
- A sufficient condition for a family of graphs being determined by their generalized spectra
- An introduction to the theory of graph spectra
- Title not available (Why is that?)
- Towards a spectral theory of graphs based on the signless Laplacian. I
- Title not available (Why is that?)
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- Can One Hear the Shape of a Drum?
- The lollipop graph is determined by its \(Q\)-spectrum
- On a signless Laplacian spectral characterization of \(T\)-shape trees
- A simple arithmetic criterion for graphs being determined by their generalized spectra
- Generalized spectral characterization of graphs revisited
- On hearing the shape of a drum
- An excluding algorithm for testing whether a family of graphs are determined by their generalized spectra
- Graph isomorphism in quasipolynomial time (extended abstract)
- Signless Laplacian spectral characterization of 4-rose graphs
Cited In (17)
- Generalized distance spectral characterizations of graphs based on Smith norm form
- On the Smith normal form of walk matrices
- An arithmetic criterion for graphs being determined by their generalized \(A_\alpha \)-spectra
- An improved condition for a graph to be determined by its generalized spectrum
- Generalized spectral characterization of mixed graphs
- On the generalized \(A_\alpha\)-spectral characterizations of almost \(\alpha\)-controllable graphs
- Construction of graphs with distinct \(A_\alpha \)-eigenvalues
- Generalized spectral characterizations of almost controllable graphs
- Generalized spectral characterizations of regular graphs based on graph-vectors
- A sufficient condition for a family of graphs being determined by their generalized spectra
- On the determinant of the \(Q\)-walk matrix of rooted product with a path
- A new criterion for almost controllable graphs being determined by their generalized spectra
- A simple arithmetic criterion for graphs being determined by their generalized spectra
- Generalized spectral characterization of graphs revisited
- Smith normal form and the generalized spectral characterization of oriented graphs
- An improved condition for a family of trees being determined by their generalized spectrum
- Smith normal form and the generalized spectral characterization of graphs
This page was built for publication: A new arithmetic criterion for graphs being determined by their generalized \(Q\)-spectrum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2317643)
