Affiliation:
1. 1 Department of Mathematics , University of Kashmir , Srinagar , India
2. 2 Department of Mathematics , University of Kashmir , Srinagar , India
Abstract
Abstract
Let G be a connected graph with n vertices, m edges. The distance signless Laplacian matrix DQ(G) is defined as DQ(G) = Diag(Tr(G)) + D(G), where Diag(Tr(G)) is the diagonal matrix of vertex transmissions and D(G) is the distance matrix of G. The distance signless Laplacian eigenvalues of G are the eigenvalues of DQ(G) and are denoted by δ1
Q(G), δ2
Q(G), ..., δn
Q(G). δ1
Q is called the distance signless Laplacian spectral radius of DQ(G). In this paper, we obtain upper and lower bounds for SDQ
(G) in terms of the Wiener index, the transmission degree and the order of the graph.
Reference15 articles.
1. A. Alhevaz, M. Baghipur, S. Pirzada, Y. Shang, Some inequalities involving the distance signless Laplacian eigenvalues of graphs, Transactions Combinatorics 10(1) (2021) 9–29. ⇒40
2. A. Alhevaz, M. Baghipur, E. Hashemi, H. Ramane, On the distance signless Laplacian spectrum of graphs, Bull. Malays. Math. Sci. Soc. 42 (2019) 2603–2621. ⇒40
3. A. Alhevaz, M. Baghipur, S. Paul, On the distance signless Laplacian spectral radius and the distance signless Laplacian energy of graphs, Discrete Math. Algorithms and Appl. 10(3) (2018) 1850035 (19 pages). ⇒43
4. A. Alhevaz, M. Baghipur, H. Ahmad, S. Pirzada, Brouwer type conjecture for the eigenvalues of distance signless Laplacian matrix of a graph, Linear Multilinear Algebra 69 (2019) 1–18. ⇒40
5. M. Aouchiche, P. Hansen, Two Laplacians for the distance matrix of a graph, Linear Algebra Appl. 439 (2013) 21–33. ⇒39