On the General Sum Distance Spectra of Digraphs
Let <i>G</i> be a strongly connected digraph, and <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>d</mi><mi>G</mi></msub><mrow><mo stretch...
Main Authors: | Weige Xi, Lixiang Cai, Wutao Shang, Yidan Su |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-01-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/11/2/308 |
Similar Items
-
On the spectral radius and energy of signless Laplacian matrix of digraphs
by: Hilal A. Ganie, et al.
Published: (2022-03-01) -
Sharp Upper Bounds on the Signless Laplacian Spectral Radius of Strongly Connected Digraphs
by: Xi Weige, et al.
Published: (2016-11-01) -
Some bounds on the distance-sum-connectivity matrix
by: Gülistan Kaya Gök
Published: (2018-07-01) -
Some new sharp bounds for the spectral radius of a nonnegative matrix and its application
by: Jun He, et al.
Published: (2017-10-01) -
Strongly connectable digraphs and non-transitive dice
by: Simon Joyce, et al.
Published: (2020-01-01)