New bounds on the distance Laplacian and distance signless Laplacian spectral radii
classification
🧮 math.CO
keywords
boundsdistancelaplacianspectralradiussignlessupperabove
read the original abstract
Let G be a simple undirected connected graph. In this paper, new upper bounds on the distance Laplacian spectral radius of G are obtained. Moreover, new lower and upper bounds for the distance signless Laplacian spectral radius of G are derived. Some of the above mentioned bounds are sharp and the graphs attaining the corresponding bound are characterized. Several illustrative examples are included.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.