Abstract
A Lagrange series around adjustable expansion points to compute the eigenvalues of graphs, whose characteristic polynomial is analytically known, is presented. The computations for the kite graph PnKm, whose largest eigenvalue was studied by Stevanović and Hansen [D. Stevanović and P. Hansen. The minimum spectral radius of graphs with a given clique number. Electronic Journal of Linear Algebra, 17:110-117, 2008.], are illustrated. It is found that the first term in the Lagrange series already leads to a better approximation than previously published bounds.
Original language | English |
---|---|
Article number | 59 |
Pages (from-to) | 934-943 |
Number of pages | 10 |
Journal | The Electronic Journal of Linear Algebra |
Volume | 30 |
DOIs | |
Publication status | Published - 2015 |
Keywords
- Characteristic polynomial
- Lagrange series
- Spectrum of a graph