On the General Sum Distance Spectra of Digraphs

: Let G be a strongly connected digraph, and d G ( v i , v j ) denote the distance from the vertex v i to vertex v j and be deﬁned as the length of the shortest directed path from v i to v j in G . The sum distance between vertices v i and v j in G is deﬁned as sd G ( v i , v j ) = d G ( v i , v j ) + d G ( v j , v i ) . The sum distance matrix of G is the n × n matrix SD ( G ) = ( sd G ( v i , v j )) v i , v j ∈ V ( G ) . For vertex v i ∈ V ( G ) , the sum transmission of v i in G , denoted by ST G ( v i ) or ST i , is the row sum of the sum distance matrix SD ( G ) corresponding to vertex v i . Let ST ( G ) = diag ( ST 1 , ST 2 , . . . , ST n ) be the diagonal matrix with the vertex sum transmissions of G in the diagonal and zeroes elsewhere. For any real number 0 ≤ α ≤ 1, the general sum distance matrix of G is deﬁned as SD α ( G ) = α ST ( G ) + ( 1 − α ) SD ( G ) . The eigenvalues of SD α ( G ) are called the general sum distance eigenvalues of G , the spectral radius of SD α ( G ) , i.e., the largest eigenvalue of SD α ( G ) , is called the general sum distance spectral radius of G , denoted by µ α ( G ) . In this paper, we ﬁrst give some spectral properties of SD α ( G ) . We also characterize the digraph minimizes the general sum distance spectral radius among all strongly connected r -partite digraphs. Moreover, for digraphs that are not sum transmission regular, we give a lower bound on the difference between the maximum vertex sum transmission and the general sum distance spectral radius.


Introduction
Let G = (V(G), E(G)) be a digraph with vertex set V(G) = {v 1 , v 2 , . . ., v n } and arc set E(G).If there is an arc from the vertex v i to vertex v j , then v i is said to be adjacent to v j , and we denote this arc by writing (v i , v j ).For the arc (v i , v j ), the first vertex v i is its tail, and the second vertex v j is its head.For any vertex v i ∈ V(G), the outdegree of v i is the number of arcs of which v i is the tail.A digraph G is simple if it has no loops and multiple arcs.A digraph G is strongly connected if for every pair of vertices v i , v j ∈ V(G), there is a directed path from v i to v j and one from v j to v i .Throughout this paper, we consider finite, simple strongly connected digraphs.
A digraph is a r-partite digraph if its vertices can be partitioned into r arcless sets.Let T n,r denote the complete r-partite digraph of order n, whose partition sets are of size n r or n r .Let ←→ K n denote the complete digraph of order n in which for two arbitrary distinct vertices v i , v j ∈ V( ←→ K n ), there are arcs (v i , v j ) and (v j , v i ) in E( ←→ K n ).For a strongly connected digraph G, the distance from the vertex v i to vertex v j , denoted by d G (v i , v j ), is defined as the length of the shortest directed path from v i to v j in G.The diameter of the strongly connected digraph G, denoted by diam(G), is the maximum d G (v i , v j ) over all ordered pairs of vertices v i , v j .
Let D(G) = (d G (v i , v j )) n×n be the distance matrix of G, where d G (v i , v j ) is the distance from v i to v j .For vertex v i ∈ V(G), the transmission of v i in G, denoted by Tr G (v i ) or Tr i , is defined as the sum of distances from v i to all other vertices in G, that is, Let Tr(G) = diag(Tr 1 , Tr 2 , . . ., Tr n ) be the diagonal matrix with vertex transmissions of G in the diagonal and zeroes elsewhere.Then, the distance signless Laplacian matrix of G is the matrix D Q (G) = Tr(G) + D(G).For any real number 0 ≤ α ≤ 1, the general distance matrix of G is defined as the matrix D α (G) = αTr(G) + (1 − α)D(G).
Spectral graph theory is a fast-growing branch of algebraic graph theory.One of the central issues in spectral graph theory is as follows: For a graph matrix, determine the maximization or minimization of spectral invariants over various families of graphs.Recently, the spectral radius of the distance matrix, the related distance signless Laplacian matrix, and the general distance matrix of digraphs have received increasing attention, see [1][2][3][4][5][6].In particular, Lin et al. [6] characterized the extremal digraphs with minimum distance spectral radius among all digraphs with given vertex connectivity.Xi and Wang [4] determined the strongly connected digraphs minimizing distance spectral radius among all strongly connected digraphs with a given diameter d, for d = 1, 2, 3, 4, 5, 6, 7, n − 1. Li et al. [2] characterized the digraph minimizing the distance signless Laplacian spectral radius among all strongly connected digraphs with given vertex connectivity.Xi et al. [7] characterized the extremal digraph achieving the minimum distance signless Laplacian spectral radius among all strongly connected digraphs with given arc connectivity.Xi et al. [8] proposed to study the generalized distance spectral radius of strongly connected digraphs, and they determined the digraphs which attain the minimum D α spectral radius among all strongly connected digraphs with given parameters such as dichromatic number, vertex connectivity, or arc connectivity.
The matrices related to simple, undirected graphs are symmetric matrices, which have well-defined spectral properties.However, unless the digraph G is symmetric, it is not the case that d G (v i , v j ) = d G (v j , v i ) for all vertices v i , v j of G; that is, the symmetric property does not hold for directed distance.In order to produce a symmetric matrix from a digraph, Chartrand and Tian [9] proposed one metric on strongly connected digraphs: sum distance defined as sd G (v i , v j ) = d G (v i , v j ) + d G (v j , v i ); then, one can obtain a symmetric matrix on a strongly connected digraph, which is called the sum distance matrix.
Let G be a strongly connected digraph of order n, V(G) = {v 1 , v 2 , . . ., v n } be the vertex set, and E(G) be the arc set.The sum distance matrix of G is the n ; otherwise, G is not sum transmission regular.Let ST(G) = diag(ST 1 , ST 2 , . . ., ST n ) be the diagonal matrix with vertex sum transmissions of G in the diagonal and zeroes elsewhere.The matrix SL(G) = SD(G) − ST(G) is called the sum distance Laplacian matrix of G, and the matrix SQ(G) = SD(G) + ST(G) is called the sum distance signless Laplacian matrix of G.Note that all the matrices SD(G), SL(G) and SQ(G) are symmetric.Therefore, they have real eigenvalues.The eigenvalues of SD(G) are called the sum distance eigenvalues of G, denoted by For any real number 0 ≤ α ≤ 1, similar to [8,10], Xu and Zhou [11] proposed to study the general sum distance matrix of G: (G).The matrix SD α (G) enables a unified study of SD(G) and SQ(G).The eigenvalues of SD α (G) are called the general sum distance eigenvalues of G, The spectral radius of SD α (G), i.e., the largest eigenvalue of SD α (G), is called the general sum distance spectral radius of G, denoted by µ α (G).For a strongly connected digraph G, SD α (G) is a non-negative irreducible matrix.Based on the Perron Frobenius Theorem [12], µ α (G) is a simple eigenvalue of SD α (G), and there is a positive unit eigenvector corresponding to µ α (G).The positive unit eigenvector corresponding to µ α (G) is called the Perron vector of SD α (G).
In this paper, we first give some spectral properties of SD α (G).We also characterize the digraph minimizes the general sum distance spectral radius among all strongly connected r-partite digraphs.Moreover, for digraphs that are not sum transmission regular, we give a lower bound on the difference between the maximum vertex sum transmission and the general sum distance spectral radius.

Preliminaries and Basic Properties of SD α (G)
For i = 1, 2, . . ., n, ρ i (A) denotes the i-th largest eigenvalue of Hermitian matrix A. In the following, we give Weyl's inequalities [12] for eigenvalues of Hermitian matrices, and the equality case was first established by So in [13].

Lemma 1 ([12] Theorem WS).
Let A and B be two Hermitian matrices of order n, and also let Moreover, either of the equality holds if and only if there exists a unit vector that is an eigenvector to each of the three eigenvalues involved.

Lemma 2 ([14] Interlacing Theorem).
Let A be a real symmetric matrix of order n, and B be a principal submatrix of A with order s.Then, Let M be a real matrix of order n described in the following block form: , where the diagonal blocks M ii are n i × n i matrices for any i ∈ {1, 2, . . ., t} and n is called the quotient matrix of M. In addition, if for each pair i, j, M ij has a constant row sum, then B(M) is called the equitable quotient matrix of M.

Lemma 3 ([15]
).Let M = (m ij ) n×n be defined as above, B = (b ij ) be the equitable quotient matrix of M.Then, the spectrum of B is contained in the spectrum of A. Moreover, if M is a non-negative matrix, then ρ 1 (B) = ρ 1 (M), where ρ 1 (B) is the spectral radius of B .
Proposition 2. Let G be a strongly connected digraph of order n ≥ 3 with Proof.
, it is easy to know that M is a diagonally dominant matrix.Therefore, we have M as a diagonally dominant with non-negative diagonal entries when 1 > α ≥ 1  2 , so it is a positive semi-definite matrix, which implies that the least eigenvalue is at least zero.Hence, for 1 ≤ k ≤ n, by Lemma 1, we obtain . Thus, we achieve the desired result.
For the complete digraph , where I n is the n × n identity matrix and J n is the n × n matrix in which every entry is 1.Thus, σ(SD α ( denotes the spectrum of the matrix SD α ( ←→ K n ), and (2αn − 2) [n−1] denotes 2αn − 2 is an eigenvalue of multiplicity n − 1.

Proposition 3.
Let G be a strongly connected digraph of order n ≥ 3.Then, for any with equality if and only if G ∼ = ←→ K n .
Proof.By Proposition 2, we obtain Hence, g(2n − 1) > 0 and g(2αn − 2) > 0. Since g(x) is strictly decreasing when x ≤ n + αn − 3 2 and strictly increasing when with equality if and only if For a strongly connected digraph G of order n, SD α (G) = SD α is the general sum x n ) T be a real column vector; then, (3)

The General Sum Distance Spectral Radius of Strongly Connected Digraphs
In this section, we study the general sum distance spectral radius of strongly connected digraphs.

Lemma 4 ([12]
).Let P = (p ij ) be an n × n non-negative matrix with spectral radius ρ(P), and let R i (P) be the i-th row sum of P, i.e., R i Moreover, if P is irreducible, then any equality holds if and only if R From Lemma 4, we have the following theorem: where then either one equality holds if and only if G is sum transmission regular.
Proof.Since ST(G) = diag(ST 1 , ST 2 , . . ., ST n ) is the diagonal matrix with vertex sum transmissions of G in the diagonal and zeroes elsewhere, with a simple calculation, we obtain the i-th row sum of ST(G) Using Lemma 4, the required result follows.For 1 2 < α < 1, suppose that either of the equalities holds; then, Lemma 4 implies that the row sums of ST(G) −1 SD α (G)ST(G) are all equal.That is, for any vertices v i , v j ∈ V(G), Let ST max and ST min denote the maximum and minimum vertex sum transmissions of G, respectively.Without a loss of generality, assume that ST 1 = ST max and ST n = ST min .
One can easily see that which implies that ST max = ST min for 1 2 < α < 1.Therefore, G is the sum transmis- sion regular.
Conversely, if G is an r-sum-transmission-regular digraph, then µ α (G) = r.On the other hand, through a simple calculation, we obtain for any v i ∈ V(G).Therefore, both equalities hold.

Lemma 5.
Let G be a strongly connected digraph with (v i , v j ) / ∈ E(G), where v i , v j ∈ V(G).Then, for any Recall that T n,r denotes the complete r-partite digraph of order n, whose partition sets are of size n r or n r .Note that T n,2 . It is known that T n,r has maximum number of arcs among all r-partite digraphs of order n.Then, we have T n,r , which has the minimum µ α (G) among all strongly connected r-partite digraphs of order n.We will consider the case r = 2 first.Theorem 2. Let G be a strongly connected bipartite digraph with order n.Then, for any 1 > α ≥ 0, Proof.Suppose that G is a strongly connected bipartite digraph of order n with minimum µ α (G) among all strongly connected bipartite digraphs of order n; then, based on Lemma 5, G is a complete bipartite digraph.Let V 1 and V 2 be the partitions of the vertex set of G, where Let X be the Perron vector of µ α (G).One can easily infer that the entries of X corresponding to vertices in the same partition set have the same value, say, x i for V i , i = 1, 2. Thus, X can be written as X = (x 1 , x 1 , . . ., x 1 ).From SD α (G)X = µ α (G)X, and we have Combining the above two equations, we have 2 and increasing for In general, for r ≥ 2, we have the following theorem: Theorem 3. Let G be a strongly connected r-partite digraph of order n, where r ≥ 2.Then, for any with equality if and only if G ∼ = T n,r .
Proof.Suppose that G is a strongly connected r-partite digraph of order n with minimum µ α (G) among all strongly connected r-partite digraphs of order n; then, based on Lemma 5, we have G, which is a complete r-partite digraph.Let V 1 , V 2 , . . ., V r be the partition sets of V(G), where Let X be the Perron vector of µ α (G).One can easily infer that the entries of X corresponding to vertices in the same partition set have the same value, say, Furthermore, From the above equation, we have one can easily see that 5) is attained if and only if z k = n r or z k = n r for any k = 1, 2, . . ., r.In fact, the minimum of ( 5) can be attained, as there are finitely many vectors (z 1 , z 2 , . . ., z r ) satisfying the constraints.Suppose that the minimum of ( 5) is attained for some z 1 , z 2 , . . ., z r , and through symmetry, we can assume that the calculation is completed.In the following, we assume z 1 − z r ≥ 2 for a contradiction.Taking According to the mean value theorem, there exist r for any k = 1, 2, . . ., r.Let µ α (T n,r ) = µ and s 1 , s 2 , . . ., s r be the sizes of the partition sets of T n,r , that is On the other hand, Thus, µ α (G) ≥ µ = µ α (T n,r ), with equality if and only if n k = n r or n k = n r for any k = 1, 2, . . ., r.

The General Sum Distance Spectral Radius and Maximum Sum Transmission of Digraphs
Lemma 6 ([16]).If a, b > 0, then a(x − y) 2 + by 2 ≥ ab a+b x 2 with equality if and only if y = a a+b x.
Let G be a strongly connected digraph of order n.As µ α (G) ≤ ST 1 with equality if and only if G is sum transmission regular, where ST 1 = max 1≤i≤n {ST i }.For a strongly connected non-sum-transmission-regular digraph G of order n, µ α (G) < ST 1 .However, we want to know how small ST 1 − µ α (G) can be when G is a non-sum-transmission-regular digraph.In the following, we will give a lower bound on ST 1 − µ α (G) .Theorem 4. Let G = (V(G), E(G)) be a strongly connected digraph which is not sum transmission regular, {ST 1 , ST 2 , . . ., ST n } be the sum transmission sequence with Proof.Let X = (x 1 , x 2 , . . ., x n ) T be the Perron vector of SD α (G) corresponding to µ α (G), where x i corresponds to the vertex v i .Clearly, Suppose that v s , v t are two vertices satisfying x s = max 1≤i≤n x i and x t = min 1≤i≤n x i , respectively.Taking Since G is not a sum-transmission-regular digraph, we have x s > x t , and thus which implies that x 2 s > µ α (G) 2W .Furthermore, with (1), we obtain In the following, we will estimate . .v l+1 be the shortest directed path from v s and v t , where v 1 = v s , v l+1 = v t , and l ≥ 1, then For convenience, set For any v i ∈ V(G)\V(Q), using the Cauchy-Schwarz inequality, we have and then Moreover, based on the Cauchy-Schwarz inequality, we obtain Then, we consider the following three cases: Case 1: l = 1.In this case, we have Hence, Case 2: l ≥ 2 and l is even.Then, and Thus, x 2 s (using Lemma 6). .

Conclusions
In this paper, we first gave some spectral properties of SD α (G).Moreover, we also characterized the digraph that has the minimum general sum distance spectral radius among all strongly connected r-partite digraphs.Finally, for a strongly connected non-sumtransmission-regular digraph G of order n, we obtained a lower bound on ST 1 − µ α (G), where ST 1 = max 1≤i≤n {ST i }.
Author Contributions: W.X. wrote the main manuscript text.L.C., W.S. and Y.S. obtained the main result of the fourth part.All authors have read and agreed to the published version of the manuscript.