Back to Search
Start Over
The Laplacian spread of quasi-tree graphs
- Source :
-
Linear Algebra & its Applications . Jul2011, Vol. 435 Issue 1, p60-66. 7p. - Publication Year :
- 2011
-
Abstract
- Abstract: The Laplacian spread of a graph is defined to be the difference between the largest eigenvalue and the second-smallest eigenvalue of the Laplacian matrix of the graph. Bao, Tan and Fan [Y.H. Bao, Y.Y. Tan,Y.Z. Fan, The Laplacian spread of unicyclic graphs, Appl. Math. Lett. 22 (2009) 1011–1015.] characterize the unique unicyclic graph with maximum Laplacian spread among all connected unicyclic graphs of fixed order. In this paper, we characterize the unique quasi-tree graph with maximum Laplacian spread among all quasi-tree graphs in the set with . [Copyright &y& Elsevier]
- Subjects :
- *TREE graphs
*EIGENVALUES
*MATRICES (Mathematics)
*SET theory
*MATHEMATICAL analysis
Subjects
Details
- Language :
- English
- ISSN :
- 00243795
- Volume :
- 435
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Linear Algebra & its Applications
- Publication Type :
- Academic Journal
- Accession number :
- 59329098
- Full Text :
- https://doi.org/10.1016/j.laa.2010.04.013