Characterizing threshold graphs with \(k\) main signless Laplacian eigenvalues
From MaRDI portal
Publication:2185837
DOI10.1016/j.laa.2020.04.022zbMath1441.05147MaRDI QIDQ2185837
Rodrigo Chimelli, Cybele T. M. Vinagre, Vilmar Trevisan, Johann Bolckau
Publication date: 5 June 2020
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2020.04.022
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Trees, unicyclic graphs and bicyclic graphs with exactly two \(Q\)-main eigenvalues
- On the spectrum of threshold graphs
- Signless Laplacians of finite graphs
- No threshold graphs are cospectral
- Spectra, signless Laplacian and Laplacian spectra of complementary prisms of graphs
- Unicyclic and bicyclic graphs with exactly three \(Q\)-main eigenvalues
- Threshold graphs and related topics
- Fast algorithms for computing the characteristic polynomial of threshold and chain graphs
- Exponentially many graphs have a \(Q\)-cospectral mate
- Exploring Symmetries to Decompose Matrices and Graphs Preserving the Spectrum
- On the Main Eigenvalues of Universal Adjacency Matrices and U-Controllable Graphs
- Towards a spectral theory of graphs based on the signless Laplacian, I
- A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives
- On graphs with exactly three Q-main eigenvalues
- On the main signless Laplacian eigenvalues of a graph