On bipartite graphs with small number of laplacian eigenvalues greater than two and three

DOI10.1080/03081080008818645zbMath0964.05040OpenAlexW1970657447MaRDI QIDQ4498327

Ivan Gutman, Mirko Lepović, Bojana Milekić, Miroslav M. Petrović

Publication date: 16 July 2001

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

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

zbMATH Keywords

bipartite graphsLaplacian eigenvalues

Mathematics Subject Classification ID

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

Related Items

Nonsingular mixed graphs with few eigenvalues greater than two ⋮ Graphs with at most one signless Laplacian eigenvalue exceeding three ⋮ On graphs with exactly three \(Q\)-eigenvalues at least two ⋮ Graphs with fourth Laplacian eigenvalue less than two ⋮ Graphs with small second largest Laplacian eigenvalue ⋮ Signless Laplacian eigenvalues and circumference of graphs ⋮ Bipartite graphs with small third Laplacian eigenvalue. ⋮ On graphs with at most three Laplacian eigenvalues greater than or equal to two. ⋮ Vertex-connectivity, chromatic number, domination number, maximum degree and Laplacian eigenvalue distribution ⋮ On the eigenvalue two and matching number of a tree ⋮ Non-bipartite graphs with third largest Laplacian eigenvalue less than three ⋮ On graphs with small number of Laplacian eigenvalues greater than two

Cites Work

• Laplacian matrices of graphs: A survey
• Graphs with constant \(\mu\) and \(\overline{\mu}\)
• The Laplacian Spectrum of a Graph
• On the second largest eigenvalue of line graphs