论文信息 - Tight Estimates for Eigenvalues of Regular Graphs

Tight Estimates for Eigenvalues of Regular Graphs

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 least $2 \sqrt {d-1} \cos \big({\pi\over 2 k}\big)$. A similar result has been proved by Friedman using more sophisticated tools.

A. Nilli | Alon Nilli

[1] Sebastian M. Cioaba. On the extreme eigenvalues of regular graphs , 2006, J. Comb. Theory, Ser. B.

[2] W. Li,et al. Spectra of Hypergraphs and Applications , 1996 .

[3] Noga Alon,et al. On the second eigenvalue of a graph , 1991, Discret. Math..

[4] Underwood Dudley. Elementary Number Theory , 1978 .

[5] J. Friedman. Some geometric aspects of graphs and their eigenfunctions , 1993 .

[6] Alexander Lubotzky,et al. Explicit expanders and the Ramanujan conjectures , 1986, STOC '86.

[7] Giuliana P. Davidoff,et al. Elementary number theory, group theory, and Ramanujan graphs , 2003 .

[8] Nabil Kahale,et al. On the second eigenvalue and linear expansion of regular graphs , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[9] Joel Friedman,et al. A proof of Alon's second eigenvalue conjecture and related problems , 2004, ArXiv.

[10] W. Li. On negative eigenvalues of regular graphs , 2001 .