Matchings in regular graphs from eigenvalues
Journal of Combinatorial Theory Series B
Hi-index | 0.00 |
In this article, we obtain a sufficient condition for the existence of regular factors in a regular graph in terms of its third largest eigenvalue. We also determine all values of k such that every r-regular graph with the third largest eigenvalue at most has a k-factor. © 2012 Wiley Periodicals, Inc. (Contract grant sponsor: National Natural Science Foundation of China; Contract grant number: 11101329; Contract grant sponsor: Fundamental Research Funds for the Central Universities.)