Sciweavers

2270 search results - page 18 / 454
» On the distribution of eigenvalues of graphs
Sort
View
96
Voted
JCT
2006
54views more  JCT 2006»
14 years 11 months ago
Spectral estimates for Abelian Cayley graphs
We give two short proofs that for fixed d, a d-regular Cayley graph on an Abelian group of order n has second eigenvalue bounded below by d - O(dn-4/d), where the implied constant...
Joel Friedman, Ram Murty, Jean-Pierre Tillich
ENDM
2002
84views more  ENDM 2002»
14 years 11 months ago
Addressing the Petersen graph
Motivated by a problem on message routing in communication networks, Graham and Pollak proposed a scheme for addressing the vertices of a graph G by N-tuples of three symbols in s...
Randall J. Elzinga, David A. Gregory, Kevin N. Van...
JCT
2007
119views more  JCT 2007»
14 years 11 months ago
Cliques and the spectral radius
We prove a number of relations between the number of cliques of a graph G and the largest eigenvalue (G) of its adjacency matrix. In particular, writing ks (G) for the number of s...
Béla Bollobás, Vladimir Nikiforov
WAOA
2010
Springer
251views Algorithms» more  WAOA 2010»
14 years 9 months ago
How to Play Unique Games on Expanders
In this paper, we improve a result by Arora, Khot, Kolla, Steurer, Tulsiani, and Vishnoi on solving the Unique Games problem on expanders. Given a (1-)-satisfiable instance of Uniq...
Konstantin Makarychev, Yury Makarychev
CPC
2006
92views more  CPC 2006»
14 years 11 months ago
Waiting for a Bat to Fly By (in Polynomial Time)
We observe returns of a simple random walk on a finite graph to a fixed node, and would like to infer properties of the graph, in particular properties of the spectrum of the trans...
Itai Benjamini, Gady Kozma, László L...