Back to Search
Start Over
The least eigenvalues of the signless Laplacian of non-bipartite graphs with pendant vertices
- Source :
-
Discrete Mathematics . Apr2013, Vol. 313 Issue 7, p903-909. 7p. - Publication Year :
- 2013
-
Abstract
- Abstract: In this paper, we determine the graph whose least eigenvalue of the signless Laplacian attains the minimum or maximum among all connected non-bipartite graphs of fixed order and given number of pendant vertices. Thus we obtain a lower bound and an upper bound for the least eigenvalue of the signless Laplacian of a graph in terms of the number of pendant vertices. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 0012365X
- Volume :
- 313
- Issue :
- 7
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 85397476
- Full Text :
- https://doi.org/10.1016/j.disc.2013.01.002