Graphs with at most one signless Laplacian eigenvalue exceeding three

DOI10.1080/03081087.2013.869590zbMath1306.05143OpenAlexW2087964694MaRDI QIDQ2938345

Bo Zhou, Hongying Lin

Publication date: 14 January 2015

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2013.869590

zbMATH Keywords

signless Laplacian matrixsignless Laplacian spectrumnon-bipartite graphforbidden subgraphsignless Laplacian eigenvalues

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

On graphs with three distinct signless Laplacian eigenvalues ⋮ Sharp upper bounds of $A_\alpha$-spectral radius of cacti with given pendant vertices

Cites Work

• Bipartiteness and the least eigenvalue of signless Laplacian of graphs
• Signless Laplacians of finite graphs
• Signless Laplacian spectral radius and Hamiltonicity
• Signless Laplacian eigenvalues and circumference of graphs
• The Laplacian Spectrum of a Graph
• On bipartite graphs with small number of laplacian eigenvalues greater than two and three

This page was built for publication: Graphs with at most one signless Laplacian eigenvalue exceeding three