Expanding graphs, Ramanujan graphs, and 1-factor perturbations

Details Expanding graphs, Ramanujan graphs, and 1-factor perturbations Expanding graphs, Ramanujan graphs, and 1-factor perturbations

2005-03-16

arxiv.org/abs/math/0503330v1

Mathematics

Combinatorics

Scientific paper

We construct (k+-1)-regular graphs which provide sequences of expanders by adding or substracting appropriate 1-factors from given sequences of k-regular graphs. We compute numerical examples in a few cases for which the given sequences are from the work of Lubotzky, Phillips, and Sarnak (with k-1 the order of a finite field). If k+1 = 7, our construction results in a sequence of 7-regular expanders with all spectral gaps at least about 1.52.

Affiliated with

Also associated with

No associations

Rating

Expanding graphs, Ramanujan graphs, and 1-factor perturbations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Expanding graphs, Ramanujan graphs, and 1-factor perturbations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Expanding graphs, Ramanujan graphs, and 1-factor perturbations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-569203