Back to Search
Start Over
Bounds on the entries of the principal eigenvector of the distance signless Laplacian matrix.
- Source :
-
Linear Algebra & its Applications . Oct2015, Vol. 483, p200-220. 21p. - Publication Year :
- 2015
-
Abstract
- The distance signless Laplacian spectral radius of a connected graph G is the largest eigenvalue of the distance signless Laplacian matrix of G , defined as D Q ( G ) = T r ( G ) + D ( G ) , where D ( G ) is the distance matrix of G and T r ( G ) is the diagonal matrix of vertex transmissions of G . In this paper we determine upper and lower bounds on the minimal and maximal entries of the principal eigenvector of D Q ( G ) and characterize the extremal graphs. In addition, we obtain a lower bound on the distance signless Laplacian spectral radius of G based on its order and independence number, and characterize the extremal graph. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00243795
- Volume :
- 483
- Database :
- Academic Search Index
- Journal :
- Linear Algebra & its Applications
- Publication Type :
- Academic Journal
- Accession number :
- 108966508
- Full Text :
- https://doi.org/10.1016/j.laa.2015.06.003