28 search results - page 1 / 6 » On the extreme eigenvalues of regular graphs |
JCT
2006
13 years 4 months ago
2006
APPML
2006
13 years 5 months ago
2006
An eigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero, and it is well known that a graph has exactly one ma...
JCT
2007
13 years 4 months ago
2007
COMBINATORICS
2000
13 years 4 months ago
2000
A graph with diameter d is strongly distance-regular if is distanceregular and its distance-d graph d is strongly regular. The known examples are all the connected strongly regu...
COMBINATORICS
2004
13 years 4 months ago
2004
It is shown that if a d-regular graph contains s vertices so that the distance between any pair is at least 4k, then its adjacency matrix has at least s eigenvalues which are at l...