Article ID Journal Published Year Pages File Type
4649873 Discrete Mathematics 2009 6 Pages PDF
Abstract

Some new upper bounds and lower bounds are obtained for the spread λ1−λnλ1−λn of the eigenvalues λ1≥λ2≥⋯≥λnλ1≥λ2≥⋯≥λn of the adjacency matrix of a simple graph.

Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
, ,