Back to Search
Start Over
The largest eigenvalue of unicyclic graphs
- Source :
-
Discrete Mathematics . Jan2007, Vol. 307 Issue 2, p280-284. 5p. - Publication Year :
- 2007
-
Abstract
- Abstract: Let G be a simple graph. Let and denote the largest eigenvalue of the adjacency matrix and the Laplacian matrix of G, respectively. Let denote the largest vertex degree. If G has just one cycle, thenThe equality holds if and only if . AndThe equality holds if and only if , n is even. [Copyright &y& Elsevier]
- Subjects :
- *MATRICES (Mathematics)
*MATHEMATICS
*MATHEMATICAL analysis
*GRAPH theory
Subjects
Details
- Language :
- English
- ISSN :
- 0012365X
- Volume :
- 307
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 23352683
- Full Text :
- https://doi.org/10.1016/j.disc.2006.06.023