Regular factors of regular graphs from eigenvalues
Combinatorics
2010-03-10 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1003.1785,
title = {Regular factors of regular graphs from eigenvalues},
author = {Hongliang Lu},
journal= {arXiv preprint arXiv:1003.1785},
year = {2010}
}