No Detail Found!

Distance signless Laplacian eigenvalues, diameter, and clique number

Author(s)
Saleem Khan Department of Mathematics, University of Kashmir,Srinagar, Kashmir,India
Shariefuddin Pirzada Department of Mathematics, University of Kashmir,Srinagar, Kashmir,India
Abstract
Let G be a connected graph of order n. Let Diag(T r) be the diagonal matrix of vertex transmissions and let D(G) be the distance matrix of G. The distance signless Laplacian matrix of G is defined as DQ(G) = Diag(T r) + D(G) and the eigenvalues of DQ(G) are called the distance signless Laplacian eigenvalues of G. Let @1Q(G) @2Q(G) @nQ(G) be the distance signless Laplacian eigenvalues of G. The largest eigenvalue @1Q(G) is called the distance signless Laplacian spectral radius. We obtain a lower bound for @1Q(G) in terms of the diameter and order of G. With a given interval I, denote by mDQ(G)I the number of distance signless Laplacian eigenvalues of G which lie in I. For a given interval I, we also obtain several bounds on mDQ(G)I in terms of various structural parameters of the graph G, including diameter and clique number.
Publication Details
Page(s) 28-31
Published Journal: Discrete Mathematics Letters, Volume: 10, Issue: 0, Year: 2022

Request the full text from PASTIC

Keywords
diameter, distance matrix, distance signless Laplacian matrix, spectral radius, clique number
0

Citations

0

Downloads

39

Views