Main Q-eigenvalues and generalized Q-cospectrality of graphs
From MaRDI portal
Recommendations
Cites work
- A note on cospectral graphs
- A sufficient condition for a family of graphs being determined by their generalized spectra
- Constructing cospectral graphs
- Controllable graphs with least eigenvalue at least \(-2\)
- Controllable subsets in graphs
- Cospectral graphs and regular orthogonal matrices of level 2
- Cospectral graphs and the generalized adjacency matrix
- Developments on spectral characterizations of graphs
- Enumeration of cospectral graphs.
- Laplacian spectral characterization of some graphs obtained by product operation
- On the spectral characterization of T-shape trees
- Signless Laplacians of finite graphs
- Some results on graph spectra
- Spectral characterization of line graphs of starlike trees
- Starlike trees whose maximum degree exceed 4 are determined by their Q-spectra
- The main eigenvalues of a graph: a survey
- The walk partition and colorations of a graph
- Which graphs are determined by their spectrum?
This page was built for publication: Main Q-eigenvalues and generalized Q-cospectrality of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q254748)