Abstract
An eigenvalue of a graph G is called main if there is an associated eigenvector not orthogonal to j, the vector with each entry equal to 1. In this work, an error in a prior paper [Y. Hou and F. Tian, Unicyclic graphs with exactly two main eigenvalues, Appl. Math. Letters, 19 (2006), 1143-1147] is pointed out and the properties of the graphs with exactly two main eigenvalues and with pendent vertices are discussed. As an application, we obtain, together with known results, all connected bicyclic and tricyclic graphs with exactly two main eigenvalues.
| Original language | English |
|---|---|
| Pages (from-to) | 1274-1278 |
| Number of pages | 5 |
| Journal | Applied Mathematics Letters |
| Volume | 25 |
| Issue number | 10 |
| DOIs | |
| Publication status | Published - Oct 2012 |
User-Defined Keywords
- 2-walk linear graphs
- Bicyclic graphs
- Main eigenvalues
- Tricyclic graphs
Fingerprint
Dive into the research topics of 'Some results on graphs with exactly two main eigenvalues'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver