Graphs with at most one signless Laplacian eigenvalue exceeding three

DOI10.1080/03081087.2013.869590MaRDI QIDQ2938345zbMATH OpenOpenAlexFDO

Authors Hongying Lin, Bo Zhou

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

forbidden subgraphnon-bipartite graphsignless Laplacian eigenvaluessignless Laplacian matrixsignless Laplacian spectrum

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(5)

• On graphs with at most three Laplacian eigenvalues greater than or equal to two.
• The signed graphs with all but at most three eigenvalues equal to \(-1\)
• On graphs with three distinct signless Laplacian eigenvalues
• Sharp upper bounds of A_\alpha-spectral radius of cacti with given pendant vertices
• Distribution of signless Laplacian eigenvalues and graph invariants

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938345)