On graphs with distance Laplacian eigenvalues of multiplicity n −4

DOI10.1080/09728600.2023.2219335arXiv2202.08800MaRDI QIDQ6152612

No author found.

Publication date: 12 March 2024

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2202.08800

zbMATH Keywords

spectral radiusdistance matrixdistance Laplacian matrixmultiplicity of distance Laplacian eigenvalue

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Two Laplacians for the distance matrix of a graph
• Multiplicities of distance Laplacian eigenvalues and forbidden subgraphs
• Graphs with some distance Laplacian eigenvalue of multiplicity \(n-3\)
• On graphs with distance Laplacian spectral radius of multiplicity \(n-3\)
• On distance Laplacian spectral radius and chromatic number of graphs
• A sharp upper bound for the number of spanning trees of a graph
• Distance Laplacian eigenvalues and chromatic number in graphs
• Some properties of the distance Laplacian eigenvalues of a graph
• On the Sum of Distance Laplacian Eigenvalues of Graphs