On graphs with distance Laplacian eigenvalues of multiplicity n −4

DOI10.1080/09728600.2023.2219335MaRDI QIDQ6152612zbMATH OpenFDO

Authors

Publication date 12 March 2024

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

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

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

zbMATH Keywords

distance Laplacian matrixdistance matrixmultiplicity of distance Laplacian eigenvaluespectral radius

Mathematics Subject Classification ID

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

Abstract: Let $G$ be a connected simple graph with $n$ vertices. The distance Laplacian matrix $D^L(G)$ is defined as $D^L(G)=Diag(Tr)-D(G)$, where $Diag(Tr)$ is the diagonal matrix of vertex transmissions and $D(G)$ is the distance matrix of $G$. The eigenvalues of $D^L(G)$ are the distance Laplacian eigenvalues of $G$ and are denoted by $partia{l}_1^L(G)geqpartia{l}_2^L(G)geqdotsgeqpartia{l}_n^L(G)$. The largest eigenvalue $partia{l}_1^L(G)$ is called the distance Laplacian spectral radius. Lu et al. (2017), Fernandes et al. (2018) and Ma et al. (2018) completely characterized the graphs having some distance Laplacian eigenvalue of multiplicity $n-3$. In this paper, we characterize the graphs having distance Laplacian spectral radius of multiplicity $n-4$ together with one of the distance Laplacian eigenvalue as $n$ of multiplicity either 3 or 2. Further, we completely determine the graphs for which the distance Laplacian eigenvalue $n$ is of multiplicity $n-4$.

Recommendations

• On graphs with distance Laplacian spectral radius of multiplicity \(n-3\)
• Graphs with some distance Laplacian eigenvalue of multiplicity \(n-3\)
• On the multiplicities of distance Laplacian eigenvalues
• Some properties of the distance Laplacian eigenvalues of a graph.
• On the distance and distance Laplacian eigenvalues of graphs

Cites work

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

Cited in

(6)

• On the multiplicities of distance Laplacian eigenvalues
• Distance Laplacian spectra of graphs: a survey
• On the eigenvalues of the distance matrix of graphs with given number of pendant vertices
• On the sum of the eigenvalues of the distance Laplacian matrix of graphs with diameter three and four
• On the sum of powers of distance Laplacian eigenvalues in terms of Wiener index and complement of a graph
• On the sum of distance signless Laplacian eigenvalues of graphs

This page was built for publication: On graphs with distance Laplacian eigenvalues of multiplicity n −4

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