Article ID Journal Published Year Pages File Type
5772988 Linear Algebra and its Applications 2017 14 Pages PDF
Abstract
Let ∂1L≥∂2L≥⋯≥∂nL be the distance Laplacian eigenvalues of a connected graph G and m(∂iL) the multiplicity of ∂iL. It is well known that the graphs with m(∂1L)=n−1 are complete graphs. Recently, the graphs with m(∂1L)=n−2 have been characterised by Celso et al. In this paper, we completely determine the graphs with m(∂1L)=n−3.
Related Topics
Physical Sciences and Engineering Mathematics Algebra and Number Theory
Authors
, , ,