Eigenvalues and the degree sequences of graphs
Author:
- 1 July 1995
- journal article
- research article
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 39 (1-2) , 133-136
Abstract
Let G be a simple graph on vertices V={1,…,n}, with Laplacian matrix L=L(G). suppose L has eigenvalues λ1≥…≥λn−0, and that the degree sequence of G is d 1≥…λd n. In this paper we provide an improvement to the majorization inequalities between the spectrum and the main diagonal of L. The main result has as a corollary thatKeywords
This publication has 5 references indexed in Scilit:
- The Laplacian Spectrum of a Graph IISIAM Journal on Discrete Mathematics, 1994
- Laplacian matrices of graphs: a surveyLinear Algebra and its Applications, 1994
- On the geometry and Laplacian of a graphLinear Algebra and its Applications, 1991
- Algebraic connectivity of graphsCzechoslovak Mathematical Journal, 1973
- Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wirdAnnalen der Physik, 1847