Regular factors of regular graphs from eigenvalues

Details Regular factors of regular graphs from eigenvalues Regular factors of regular graphs from eigenvalues

2010-03-09

arxiv.org/abs/1003.1785v1

Mathematics

Combinatorics

Scientific paper

Let m and r be two integers. Let G be a connected r-regular graph of order n and k an integer depending on m and r. For even kn, we find a best upper bound (in terms of r and m) on the third largest eigenvalue that is sufficient to guarantee that G has a k-factor. When nk is odd, we give a best upper bound (in terms of r and m) on the second largest eigenvalue that is sufficient to guarantee that G is k-critical.

Affiliated with

Also associated with

No associations

Rating

Regular factors of regular graphs from eigenvalues 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 Regular factors of regular graphs from eigenvalues, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Regular factors of regular graphs from eigenvalues will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-454544