Abstract
LetG be a simple graph withn vertices. We denote by λi(G) thei-th largest eigenvalue ofG. In this paper, several results are presented concerning bounds on the eigenvalues ofG. In particular, it is shown that −1⩽λ2(G)⩽(n−2)/2, and the left hand equality holds if and only ifG is a complete graph with at least two vertices; the right hand equality holds if and only ifn is even andG℞2K n/2.
Similar content being viewed by others
References
Behzad, M., G. Chertrand and L. Lesniak-Fester, Graphs and Digraphs, Prindle weber and Schmidt, Boston, 1979.
Brigham, R. C. and R. D. Dutton, Bounds on Graph Spectra,J. Combinatorial Theory, (B) (1984), 228–234.
G. Constantine, Lower Bounds on the Spectra of Symmetric Matrices with Nonnegative Entries,Linear Algebra and its Applications,65 (1985), 171–178.
D. M. Cvetkovic, Chromatric Number and the Spectrum of a Graph,Pubi. Inst. Math. Nouvelle Ser.,14 (28) (1972), 25–28.
D. M. Cvetkovic, M. Dooband, H. Sachs, Spectra of Graphs, Academic Press, New York, 1980
A. J. Hoffman, On Eigenvalues and Colourings of Graphs, In: Graph Theory and its Applications (B. Harris, Ed.), pp. 78–91, Academic Press, Now York, 1970.
Hoffman, A. J., Eigenvalues of Graphs, In: Studies in Graph Theory, Part 2 (D. R. Fulkerson, Ed.), pp. 225–245, Math. Assn. America, Washington D. C., 1975.
Hong Yuan, On the Spectra of Unicycle Graphs,Journal of East China Normal University, Natural Science Edition No. 1. 1986.
Hong Yuan, TheK-th Largest Eigenvalue of a Tree,Linear Algebra and its Applications,73 (1986), 151–155.
A. J. Schwenk and R. J. Wilson, On the Eigenvalues of a Graph, In: Selected Topics in Graph Theory (L. W. Beineke and R. J. Wilson, Eds.), pp. 307–336.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hong, Y. Bounds of eigenvalues of a graph. Acta Mathematicae Applicatae Sinica 4, 165–168 (1988). https://doi.org/10.1007/BF02006065
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02006065