Distance signless Laplacian eigenvalues of graphs

Abstract

Suppose that the vertex set of a graph G is V(G)=\{v\mathrm{1},v\mathrm{2},\mathrm{...},vn\}. The transmission Tr(vi) (or D_i) of vertex vi is defined to be the sum of distances from vi to all other vertices. Let Tr(G) be the n\times n diagonal matrix with its (i, i)-entry equal to {{\displaystyle Tr}}_G(vi). The distance signless Laplacian spectral radius of a connected graph G is the spectral radius of the distance signless Laplacian matrix of G, defined as L(G)=Tr(G)+D(G), where D(G) is the distance matrix of G. In this paper, we give a lower bound on the distance signless Laplacian spectral radius of graphs and characterize graphs for which these bounds are best possible. We obtain a lower bound on the second largest distance signless Laplacian eigenvalue of graphs. Moreover, we present lower bounds on the spread of distance signless Laplacian matrix of graphs and trees, and characterize extremal graphs.

Keywords

Graph / distance signless Laplacian spectral radius / second largest eigenvalue of distance signless Laplacian matrix / spread

References

[1] Aouchiche M, Hansen P. A signless Laplacian for the distance matrix of a graph. Preprint

[2] Cvetković D, Doob M, Sachs H. Spectra of Graphs-Theory and Applications. 3rd ed. Heidelberg: Johann Ambrosius Barth Verlag, 1995

[3] Das K C. Proof of conjectures on the distance signless Laplacian eigenvalues of graphs. Linear Algebra Appl, 2015, 467: 100–115

[4] Dong H, Guo X. Ordering trees by their Wiener indices. MATCH Commun Math Comput Chem, 2006, 56: 527–540

[5] Haemers WH. Interlacing eigenvalues and graphs. Linear Algebra Appl, 1995, 226-228: 593–616

[6] Hong W, You L. Some sharp bounds on the distance signless Laplacian spectral radius of graphs. Preprint

[7] Indulal G. Sharp bounds on the distance spectral radius and the distance energy of graphs. Linear Algebra Appl, 2009, 430: 106–113

[8] Lin H, Das K C. Characterization of extremal graphs from distance signless Laplacian eigenvalues. Linear Algebra Appl, 2016, 500: 77–87

[9] Lin H, Lu X. Bounds on the distance signless Laplacian spectral radius in terms of clique number. Linear Multilinear Algebra, 2015, 63(9): 1750–1759

[10] Tian F, Li X, Rou J. A note on the signless Laplacian and distance signless Laplacian eigenvalues of graphs. J Math Res Appl, 2014, 34(6): 647–654

[11] Wolfram Research Inc, Mathematica. version 7.0. Champaign, IL, 2008

[12] Xing R, Zhou B. On the distance and distance signless Laplacian spectral radii of bicyclic graphs. Linear Algebra Appl, 2013, 439: 3955–3963

[13] Xing R, Zhou B, Li J. On the distance signless Laplacian spectral radius of graphs. Linear Multilinear Algebra, 2014, 62: 1377{1387

[14] Zhang F. Matrix Theory: Basic Results and Techniques. New York: Springer-Verlag, 1999

RIGHTS & PERMISSIONS

Higher Education Press and Springer-Verlag GmbH Germany, part of Springer Nature