On graphs with exactly three \(Q\)-eigenvalues at least two
From MaRDI portal
Publication:1940087
DOI10.1016/j.laa.2012.11.032zbMath1259.05118OpenAlexW2087545856MaRDI QIDQ1940087
Wei Wang, Francesco Belardo, Jianfeng Wang, Qiong Xiang Huang
Publication date: 5 March 2013
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2012.11.032
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40) Signed and weighted graphs (05C22)
Related Items (1)
Cites Work
- Unnamed Item
- A note on the signless Laplacian eigenvalues of graphs
- On the extremal values of the second largest \(Q\)-eigenvalue
- On the two largest \(Q\)-eigenvalues of graphs
- Combinatorial approach for computing the characteristic polynomial of a matrix
- Signless Laplacians of finite graphs
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- On conjectures involving second largest signless Laplacian eigenvalue of graphs
- On graphs whose signless Laplacian index does not exceed 4.5
- Graphs with fourth Laplacian eigenvalue less than two
- Enumeration of cospectral graphs.
- On graphs with at most three Laplacian eigenvalues greater than or equal to two.
- Graphs characterized by Laplacian eigenvalues
- On graphs with small number of Laplacian eigenvalues greater than two
- Signless Laplacian eigenvalues and circumference of graphs
- The Laplacian Spectrum of a Graph
- Eigenvalue bounds for the signless laplacian
- Towards a spectral theory of graphs based on the signless Laplacian, I
- On bipartite graphs with small number of laplacian eigenvalues greater than two and three
- Towards a spectral theory of graphs based on the signless Laplacian, III
This page was built for publication: On graphs with exactly three \(Q\)-eigenvalues at least two
