Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5772988 | Linear Algebra and its Applications | 2017 | 14 Pages |
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
Lu Lu, Qiongxiang Huang, Xueyi Huang,