Main Q-eigenvalues and generalized Q-cospectrality of graphs
From MaRDI portal
Publication:254748
DOI10.1007/s13226-014-0079-2zbMath1331.05137OpenAlexW2019192937MaRDI QIDQ254748
Lizhu Sun, Tianyi Bu, Jiang Zhou, Wenzhe Wang
Publication date: 8 March 2016
Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13226-014-0079-2
Cites Work
- Unnamed Item
- Laplacian spectral characterization of some graphs obtained by product operation
- Cospectral graphs and regular orthogonal matrices of level 2
- Constructing cospectral graphs
- Starlike trees whose maximum degree exceed 4 are determined by their Q-spectra
- Cospectral graphs and the generalized adjacency matrix
- Signless Laplacians of finite graphs
- Developments on spectral characterizations of graphs
- A note on cospectral graphs
- The walk partition and colorations of a graph
- Which graphs are determined by their spectrum?
- Enumeration of cospectral graphs.
- Some results on graph spectra
- Controllable subsets in graphs
- On the spectral characterization of T-shape trees
- A sufficient condition for a family of graphs being determined by their generalized spectra
- Spectral characterization of line graphs of starlike trees
- Controllable graphs with least eigenvalue at least -2
