Graphs whose Laplacian eigenvalues are almost all 1 or 2

DOI10.1515/SPMA-2024-0015MaRDI QIDQ7030004zbMATH OpenFDO

Authors A. Mohammadian, Shanshan Xu

Publication date 10 February 2025

Published in Special Matrices (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1515/SPMA-2024-0015

zbMATH Keywords

forbidden subgraphLaplacian eigenvalue

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Cites work

• A lower bound for the Laplacian eigenvalues of a graph-proof of a conjecture by Guo
• GRAPHS WITH A SMALL NUMBER OF DISTINCT EIGENVALUES
• Graphs with constant \(\mu\) and \(\overline{\mu}\)
• Graphs with four distinct Laplacian eigenvalues
• Laplacian graph eigenvectors
• On graphs with equal algebraic and vertex connectivity
• On graphs with small number of Laplacian eigenvalues greater than two
• On the graphs with larger Laplacian eigenvalues equal to two
• On the multiplicity of laplacian eigenvalues of graphs
• Permanental roots and the star degree of a graph
• Spectra of graphs
• The multiplicity of Laplacian eigenvalue two in a connected graph with a perfect matching
• Unicyclic graphs with five Laplacian eigenvalues different from 0 and 1

Cited in

(1)

• Upper bounds for the multiplicity of Laplacian eigenvalues of graphs

This page was built for publication: Graphs whose Laplacian eigenvalues are almost all 1 or 2

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