Generalized spectral characterizations of almost controllable graphs: revisited
From MaRDI portal
Cites work
- A new arithmetic criterion for graphs being determined by their generalized \(Q\)-spectrum
- 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
- A sufficient condition for a family of graphs being determined by their generalized spectra
- Almost controllable graphs and beyond
- An improved condition for a graph to be determined by its generalized spectrum
- Developments on spectral characterizations of graphs
- Generalized spectral characterization of graphs revisited
- Generalized spectral characterizations of almost controllable graphs
- Graphs with at most one generalized cospectral mate
- scientific article; zbMATH DE number 1936673 (Why is no real title available?)
- On a Conjecture of Godsil Concerning Controllable Random Graphs
- On strongly asymmetric and controllable primitive graphs
- Smith normal form and the generalized spectral characterization of graphs
- The complement of the path is determined by its spectrum
- Which graphs are determined by their spectrum?
This page was built for publication: Generalized spectral characterizations of almost controllable graphs: revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6883649)