On graphs with at most three Laplacian eigenvalues greater than or equal to two.

DOI10.1016/J.LAA.2003.07.016zbMath1034.05033OpenAlexW1991008151MaRDI QIDQ1428619

Bojana Borovićanin, Aleksandar Torgašev, Miroslav M. Petrović

Publication date: 29 March 2004

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

Full work available at URL: https://doi.org/10.1016/j.laa.2003.07.016

zbMATH Keywords

Laplacian eigenvaluesGraphSubgraph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (3)

Nonsingular mixed graphs with few eigenvalues greater than two ⋮ On graphs with exactly three \(Q\)-eigenvalues at least two ⋮ Signless Laplacian eigenvalues and circumference of graphs

Cites Work

• Laplacian matrices of graphs: A survey
• On graphs with small number of Laplacian eigenvalues greater than two
• The Laplacian Spectrum of a Graph
• Eigenvalues of the Laplacian of a graph^∗
• On bipartite graphs with small number of laplacian eigenvalues greater than two and three
• Unnamed Item
• Unnamed Item

This page was built for publication: On graphs with at most three Laplacian eigenvalues greater than or equal to two.