On the second largest eigenvalue of the signless Laplacian
From MaRDI portal
Publication:1931731
DOI10.1016/j.laa.2012.07.052zbMath1257.05093arXiv1202.0964MaRDI QIDQ1931731
Vladimir Nikiforov, Leonardo Silva de Lima
Publication date: 16 January 2013
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1202.0964
05C35: Extremal problems in graph theory
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
Related Items
Unnamed Item, On signed graphs whose second largest Laplacian eigenvalue does not exceed 3, On the Dα-spectra of graphs, Nordhaus-Gaddum-type result on the second largest signless Laplacian eigenvalue of a graph, Signless Laplacian spectrum of a graph, Characterization of extremal graphs from distance signless Laplacian eigenvalues, On the \(A_\alpha\)-spectra of graphs, On the second largest Laplacian eigenvalues of graphs, Signless Laplacian spectral characterization of some disjoint union of graphs, On (distance) signless Laplacian spectra of graphs, On the multiplicity of the least signless Laplacian eigenvalue of a graph, Minimum values of the second largest \(Q\)-eigenvalue, Bounds for the largest two eigenvalues of the signless Laplacian, On the second largest \(A_{\alpha}\)-eigenvalues of graphs, Signless Laplacian eigenvalue problems of Nordhaus-Gaddum type
Cites Work
- Unnamed Item
- Unnamed Item
- Proof of conjecture involving the second largest signless Laplacian eigenvalue and the index of graphs
- On the extremal values of the second largest \(Q\)-eigenvalue
- On the two largest \(Q\)-eigenvalues of graphs
- Signless Laplacians of finite graphs
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- Infinite families of \(Q\)-integral graphs
- On conjectures involving second largest signless Laplacian eigenvalue of graphs
- Commutativity and spectra of Hermitian matrices
- Properties of spectra of graphs and line graphs
- Eigenvalue bounds for the signless laplacian
- The Monotonicity Theorem, Cauchy's Interlace Theorem, and the Courant- Fischer Theorem
- A characterization of the smallest eigenvalue of a graph