|
Organizers |
Isoperimetric numbers of regular graphs of high degree
by
Dominic Lanphier
Western Kentucky University
Coauthors: Jason Rosenhouse
We give an estimate for the isoperimetric number h(G) of regular graphs that possess many paths of length 2. As consequences, we can estimate h(G) for random regular graphs of high degree and also give a criterion for Platonic graphs defined over the ring Z/n to be non-Ramanujan.
Date received: April 30, 2009
Copyright © 2009 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cayq-58.