Eigenvalues and the degree sequences of graphs

Author:

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 that

This publication has 5 references indexed in Scilit: