107 search results - page 7 / 22 » Eigenvalues of the derangement graph |
JCT
2007
13 years 6 months ago
2007
STOC
2003
ACM
14 years 7 months ago
2003
ACM
A d-regular graph has largest or first (adjacency matrix) eigenvalue 1 = d. In this paper we show the following conjecture of Alon. Fix an integer d > 2 and a real > 0. Then...
INFOVIS
2002
IEEE
13 years 11 months ago
2002
IEEE
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of...
EJC
2010
13 years 6 months ago
2010
A Shilla distance-regular graph (say with valency k) is a distance-regular graph with diameter 3 such that its second largest eigenvalue equals to a3. We will show that a3 divide...
DM
2002
13 years 6 months ago
2002
We consider a variation of the chip-firing game in a induced subgraph S of a graph G. Starting from a given chip configuration, if a vertex v has at least as many chips as its deg...