Back to Search
Start Over
The distance spectrum of complements of trees.
- Source :
-
Linear Algebra & its Applications . Oct2017, Vol. 530, p185-201. 17p. - Publication Year :
- 2017
-
Abstract
- Let G be a connected graph of order n and D ( G ) be its distance matrix. In this paper, we characterize the unique graphs whose distance spectral radius attains the maximum and minimum among all complements of trees. Furthermore, we determine the unique graphs whose least distance eigenvalues attains the maximum and minimum among all complements of trees. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00243795
- Volume :
- 530
- Database :
- Academic Search Index
- Journal :
- Linear Algebra & its Applications
- Publication Type :
- Academic Journal
- Accession number :
- 124249978
- Full Text :
- https://doi.org/10.1016/j.laa.2017.05.016