On Distance Signless Laplacian Spectral Radius and Distance Signless Laplacian Energy

In this article, we find sharp lower bounds for the spectral radius of the distance signless Laplacian matrix of a simple undirected connected graph and we apply these results to obtain sharp upper bounds for the distance signless Laplacian energy graph. The graphs for which those bounds are attained are characterized.


Introduction and Preliminaries on Distance Matrix
Let G = (V(G), E(G)) be a connected simple undirected graph with vertices set V(G) and edges set E(G). The distance d v i , v j between the vertices v i and v j of G is equal to the length of (number of edges in) the shortest path that connects v i and v j . The distance matrix of graph G is an n × n matrix such that the entry (i, j) is equal to the distance between vertices v i and v j of the graph G. This is D i,j (G) = d i,j = d(v i , v j ). Definition 1. Let G be a simple connected graph with V(G) = {v 1 , v 2 , . . . , v n }. The distance degree of a vertex v, denoted by Tr G (v) is defined to be the sum of the distances from v to all other vertices in G, that is, The distance degree is also called the first distance degree or Transmission of a vertex v. Let Tr (G) be the n × n diagonal matrix defined by Tr i,i (G) = Tr G (v i ).
For abbreviation, for i = 1, . . . , n, we write Tr i instead of Tr G (v i ) when no confusion can arise.

Definition 2.
A connected graph G is called a k-distance degree regular graph if Tr i = k for all i = 1, 2, . . . , n.
The Wiener index of a graph G, denoted by W (G), was introduced by Wiener [1] and is defined by It is clear, Tr G (v) .
In [2], Aouchiche and Hansen introduced the distance signless Laplacian matrix of a connected graph G as the n × n matrix defined by DQ(G) = Tr(G) + D(G), where D(G) is the distance matrix of G and Tr(G) is the diagonal matrix of vertex transmissions of G. Furthermore, they prove the equivalence between the distance Laplacian matrix, distance signless Laplacian matrix and the distance spectra for the class of transmission regular graphs.

Theorem 1 ([3]
). If A is a nonnegative matrix then its spectral radius ρ(A) is an eigenvalue of A and it has an associated nonnegative eigenvector. Furthermore, if A is irreducible, then ρ(A) is a simple eigenvalue of A with an associated positive eigenvector.
In several articles, different authors find upper and lower bounds for the distance signless Laplacian spectral radius. In [4], Hong and You gave a lower bound on the distance signless Laplacian spectral radius in terms of the sum row of matrix. In [5], the authors determined the graphs with minimum distance signless Laplacian spectral radius among the the trees, unicyclic graphs and bipartite graphs with fixed numbers of vertices, respectively, and determined the graphs with minimum distance signless Laplacian spectral radius among the connected graphs with fixed numbers of vertices and pendant vertices and the connected graphs with fixed number of vertices and connectivity, respectively. In [6], the authors gave a lower bound on the distance Laplacian spectral radius in terms of largest sum row of the distance matrix and they characterized that the extremal graph attains the maximum distance spectral radius in terms of order and the clique number of graph. In [7], Alhevaz et al. determined some upper and lower bounds on the distance signless Laplacian spectral radius of G based on its order and independence number and characterized the extremal graphs. In [8], the authors gaive bounds of the spectral radius of distance Laplacian and distance signless Laplacian matrices.
Connected simple undirected graphs are of great interest in molecular topology, a field of chemistry which reduces the molecule to a connected simple undirected graph. Eigenvalues and characteristic polynomial have found their use in the characterization of chemical compounds. On applications of eigenvalues, characteristic polynomial, distance matrix and graph invariants to chemistry, we mention the works in [9][10][11][12][13][14][15][16][17][18][19].
On the other hand, the energy of a graph is a concept defined in 1978 by Ivan Gutman [20] and originating from theoretical chemistry. Let A(G) be an adjacency matrix of a graph G of order n; then, the energy of the graph G is E(G) = n ∑ i=1 |λ i (A(G))|. Several authors study the energy of bipartite graphs, cyclic and acyclic graphs, regular graph (see, e.g., [21][22][23][24][25], and for more details on graph energy, see [26,27]). The concept energy of a graph has been extended to different matrices associated with a graph: let M be a matrix associated with a graph G; then, the energy of matrix M is defined in [28] by where λ(M(G)) is the average of eigenvalues of M. In addition, some important applications of the Laplacian spectra and Laplacian energy are covered in Sections 2.2 and 3.6 in [19]. About distance signless Laplacian energy, in [7], Alhevaz et al. gave a description of the distance signless Laplacian energy of the join of regular graphs in terms of their adjacency spectrum. In [29], Das et al. proved that the complete graph and the star give the smallest distance signless Laplacian energy among all the graphs and trees of order n, respectively. In [30], the authors gave upper bounds on the distance energy, distance Laplacian energy and distance signless Laplacian energy. Moreover, they characterized the graphs attaining the corresponding upper bound.
In this work, we find new sharp lower bounds on the distance signless Laplacian spectral radius and we find new upper bounds on the distance signless Laplacian energy.
To finish this section, we recall some results that are used in this article. The next theorem can be found, in simple form, in A. Cauchy's "Cours d'Analyse" of 1821, which were the lecture notes used at the Ecole Polytechnique of Paris [31]; the version to be presented and its proof can be found in [32].

Theorem 2. (Cauchy's Interlacing Theorem) [32] Let
A be a symmetric matrix of order n. Let B be a principal submatrix of order m obtained by deleting both ith row and ith column of A, for some values of i. Suppose A has eigenvalues λ 1 ≥ λ 2 ≥ . . . ≥ λ n and B has eigenvalues We recall that the Frobenius norm of an n × n matrix M = (m i,j ) is It is clear that,

Definition 3 ([33]
). Let G be a simple connected graph with V(G) = {v 1 , v 2 , . . . , v n }, distance matrix D i,j = d i,j and the distance degree sequence {Tr 1 , Tr 2 , . . . , Tr n }, such that Tr 1 ≥ Tr 2 ≥ . . . ≥ Tr n . Then, the second distance degree of a vertex v i , denoted by T i , is defined to be

Lower Bounds on the Distance Signless Laplacian Spectral Radius
In this section, we obtain new bounds on the distance signless Laplacian radius in terms of parameters that depend on the distance between the vertices and the order of the graph. Before that, we give some known results.

Lemma 2 ([2]).
A connected graph G has only two distinct distance signless Laplacian eigenvalues if and only if G a complete graph.

Theorem 3 ([2]
). Let G be a connected graph on n vertices and m edges, with m ≥ n. Consider the connected graphG obtained from G by the deletion of an edge. Let be the distance signless Laplacian spectra of G andG, respectively. Then, for all i = 1, . . . , n, Corollary 1. Let G be a connected graph on n vertices. Then, Let e be the n-dimensional vector of ones.

Theorem 4 ([5]
). Let G be a connected graph of order n > 2. Then, The equality holds if and only if G is a distance degree regular graph.
Theorem 5. Let G be a simple connected graph, such that, for i = 1, . . . , n, Tr i is the distance degree of vertex v i . Then, The equality holds if and only if G is a distance degree regular graph.
Theorem 6. Let G be a simple connected graph, such that, for i = 1, . . . , n, Tr i is the distance degree of vertex v i and T i is the second distance degree of vertex v i . Then, The equality holds if and only if (Tr i + T i Tr i ) is constant for all i. In fact, we observe that From Lemma 1, we have Moreover, we recall that, A generalization of Theorem 6 is the next theorem.
Theorem 7. Let G be a connected graph, α be a real number and t be an integer. Then,

The equality holds (for particular values of α and t) if and only if Tr
Therefore, Now, we assume that the equality holds. By Equation (4), we have that y is the positive eigenvector corresponding to ρ(DQ(G)). From DQ(G)y = ρ(DQ(G))y, we obtain that i for all i ∈ {1, 2, . . . , n}. Hence, Therefore, k is a eigenvalue of DQ(G) and y its corresponding eigenvector. We recall that y is a positive vector, applying the Theorem 1, we obtain k = ρ(DQ(G)). To finish, we show that Example 1. For i = 1, . . . , 7, let G i be the graphs given in Figure 1. In particular, G 5 , G 6 and G 7 are the star, path and cycle on seven vertices, denoted by S 7 , P 7 and C 7 , respectively. We observe that G 1 is a 7-distance degree regular graph and C 7 is a 12-distance degree regular graph. In Table 1 we show the lower bounds for ρ(DQ(G i )), using six decimal places. Table 1. Lower bounds for r(DQ(Gi)), using six decimal places, where Gi is given in Figure 1 G 14

Upper Bounds on the Distance Signless Laplacian Energy
In this section, we obtain new bounds on the distance signless Laplacian energy in terms of spectral radius and parameters that depend on the distance between the vertices and the order of the graph. Previously, we extend the ideas given by Koolen and Moulton [35] to the distance signless Laplacian matrix and we use the lower bounds of spectral radius obtained in the previous section. Theorem 8. Let G be a connected graph on n vertices. Then, Moreover,

1.
The function

2.
Equality holds if and only if either G is a complete graph or G has at most three distinct distance signless Laplacian eigenvalues. In particular, if G has three distinct distance signless Laplacian eigenvalues, these are  (1), we have that distance signless Laplacian energy of a graph G is

Proof. From Equation
We observe that On the other hand, Using the Cauchy-Schwarz inequality, we obtain For simplicity, we omit the (DQ(G)) notation; then, Using the equalities given in Equation (6), we have Then, from the inequality in Equation (7), we conclude that Moreover, let be a real function. We observe that the function F is a strictly decreasing on the interval Now, the equality in Equation (5) holds if and only if the equality in Equation (7) holds, which is, for i = 2, . . . , n, Therefore, only three cases are possible: (i) the graph G has only one distance signless Laplacian eigenvalues; (ii) the graph G has only two distinct distance signless Laplacian eigenvalues; or (iii) G is a graph with three distinct distance signless Laplacian eigenvalues.
In Case (i), we conclude that G = K 1 .
Then, we obtain the next three theorems. Theorem 9. Let G be a connected graph on n vertices. Then, Moreover, the equality holds if and only if either G is a complete graph or G is a distance degree regular graph with at most three distinct distance signless Laplacian eigenvalues: Proof. From Lemma 5, we obtain and, from Theorem 4 and Lemma 6, we have Then, applying Theorem 8, we conclude that Moreover, the equality holds if and only if the conditions of equality given in Theorems 5 and 8 are satisfied and the fact that E DQ (G) = F (ρ(G)). Theorem 10. Let G be a connected graph on n vertices. Then, Moreover, the bound is achieved if and only if either G is a complete graph or G is a distance degree regular graph with at most three distinct distance signless Laplacian eigenvalues: Proof. From Remark 1, Now, using Equation (9) and Lemma 6, we have Applying Theorem 8, the bound is obtained.
To show that the bound is achieved, we use the conditions of equality given in Theorems 5 and 8 and the fact that E DQ (G) = F (ρ(G)).
Theorem 11. Let G be a connected graph on n vertices. Then, Moreover, the equality holds if and only if either G is a complete graph or (a) (Tr i + T i Tr i ) is constant for all i on G and (b) G has at most three distinct distance signless Laplacian eigenvalues 2W(G) n , Proof. The proof is similar to given in Theorem 10. Example 2. We consider the graphs G 1 , G 2 , G 3 , G 4 , G 5 = S 7 , G 6 = P 7 and G 7 = C 7 given in Example 1 and F(x) given in Theorem 8. Using six decimal places, we obtain the upper bounds for distance signless Laplacian energy, as shown in the Table 2. Table 2. Upper bounds for EDQ(Gi), using six decimal places, where Gi is given in Figure 1.

Conclusions
In this paper, we find sharp lower bounds for the spectral radius of the distance signless Laplacian matrix of a simple undirected connected graph G and we apply these results to obtain sharp upper bounds for the distance signless Laplacian energy of G. The graphs for which those bounds are attained are characterized.