Title of article
Some new bounds on the spectral radius of graphs Original Research Article
Author/Authors
Kinkar Ch. Das، نويسنده , , Pawan Kumar، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
13
From page
149
To page
161
Abstract
The eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents some upper and lower bounds on the greatest eigenvalue and a lower bound on the smallest eigenvalue.
Keywords
Graph , Adjacency matrix , spectral radius
Journal title
Discrete Mathematics
Serial Year
2004
Journal title
Discrete Mathematics
Record number
948869
Link To Document