Abstract
The eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents some upper bounds on the greatest eigenvalue of graphs and lower bound on the greatest eigenvalue of trees.
| Original language | English |
|---|---|
| Pages (from-to) | 917-925 |
| Number of pages | 9 |
| Journal | Indian Journal of Pure and Applied Mathematics |
| Volume | 34 |
| Issue number | 6 |
| State | Published - Jun 2003 |
| Externally published | Yes |
Keywords
- Adjacency Matrix
- Graph
- Spectral Radius