A new criterion for almost controllable graphs being determined by their generalized spectra

DOI10.1016/j.disc.2022.113060zbMath1495.05176OpenAlexW4283213004MaRDI QIDQ2166304

Wei Wang, Lihong Qiu, Hao Zhang, Wei Wang

Publication date: 24 August 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2022.113060

zbMATH Keywords

determined by spectrumgeneralized spectrumrational orthogonal matrixalmost controllable graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (1)

Further results on almost controllable graphs

Cites Work

• Unnamed Item
• A simple arithmetic criterion for graphs being determined by their generalized spectra
• Generalized spectral characterization of graphs revisited
• Developments on spectral characterizations of graphs
• Which graphs are determined by their spectrum?
• Some results on graph spectra
• Generalized spectral characterizations of almost controllable graphs
• A new arithmetic criterion for graphs being determined by their generalized \(Q\)-spectrum
• A sufficient condition for a family of graphs being determined by their generalized spectra
• Graphs with at most one generalized cospectral mate
• On a Conjecture of Godsil Concerning Controllable Random Graphs

This page was built for publication: A new criterion for almost controllable graphs being determined by their generalized spectra