| p (2007) | |||||||||||||||||
Abstract | |||||||||||||||||
| Let G be a graph on n vertices. A 2-lift of G is a graph H on 2n vertices, with a covering map : H! G. It is not hard to see that all eigenvalues of G are also eigenvalues of H. In addition, H has n \new" eigenvalues. We conjecture that every d-regular graph has a 2-lift such that all new eigenvalues are in the range [ 2 p | |||||||||||||||||
Publication details | |||||||||||||||||
| |||||||||||||||||