Annals of Mathematics · 2014 · 57 citations · 37 references
Natural SciencesMathematicsCombinatoricsDiscrete MathematicsAbstract AlgebraGroup TheoryPermutation Groups
Given a finite group G and a set A of generators, the diameter diam((G, A)) of the Cayley graph (G, A) is the smallest such that every element of G can be expressed as a word of length at most in A A -1 . We are concerned with bounding diam(G) := maxAdiam((G, A)).
37
Expander graphs and their applications
Shlomo Hoory, Nathan Linial, Avi Wigderson · Bulletin of the American Mathematical Society · 2006 · 1.8K citations · Full text
Eigenvalues, diameter, and mean distance in graphs
Bojan Mohar · Graphs and Combinatorics · 1991 · 302 citations
Growth and generation in SL<sub>2</sub>(ℤ∕pℤ)
H. A. Helfgott · Annals of Mathematics · 2008 · 235 citations · Full text