On the General Sum Distance Spectra of Digraphs

Weige Xi (), Lixiang Cai, Wutao Shang and Yidan Su
Additional contact information
Weige Xi: College of Science, Northwest A&F University, Xianyang 712100, China
Lixiang Cai: College of Science, Northwest A&F University, Xianyang 712100, China
Wutao Shang: College of Science, Northwest A&F University, Xianyang 712100, China
Yidan Su: College of Science, Northwest A&F University, Xianyang 712100, China

Mathematics, 2023, vol. 11, issue 2, 1-14

Abstract: 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 defined 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 defined as s d 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 S D ( G ) = ( s d 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 S T G ( v i ) or S T i , is the row sum of the sum distance matrix S D ( G ) corresponding to vertex v i . Let S T ( G ) = diag ( S T 1 , S T 2 , … , S T 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 defined as S D α ( G ) = α S T ( G ) + ( 1 − α ) S D ( G ) . The eigenvalues of S D α ( G ) are called the general sum distance eigenvalues of G , the spectral radius of S D α ( G ) , i.e., the largest eigenvalue of S D α ( G ) , is called the general sum distance spectral radius of G , denoted by μ α ( G ) . In this paper, we first give some spectral properties of S D α ( 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.

Keywords: strongly connected digraph; general sum distance matrix; spectral radius (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/11/2/308/pdf (application/pdf)
https://www.mdpi.com/2227-7390/11/2/308/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:11:y:2023:i:2:p:308-:d:1027871

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().