Given r 3 3 and 1 s A s r, we determine all values of k for which every r-regular graph with edge-connectivity A has a k-factor. Some of the earliest results in graph theory are due to Petersen [8] and concern factors in graphs. Among others, Petersen proved that a regular graph of even degree has a
Regular factors of simple regular graphs and factor-spectra
β Scribed by Thomas Niessen; Bert Randerath
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 680 KB
- Volume
- 185
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
Given integers n, r and 2, we determine all values of k for which every simple r-regular graph of order n and with edge-connectivity 2 has a k-factor. Using this result we find for k >~ 2 the k-spectra Spk(n ) = {m: there exists a maximal set of m edge-disjoint k-factors of K~} which were introduced by Hoffman et al.
π SIMILAR VOLUMES
## Abstract 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.
Katerinis, P., Regular factors in regular graphs, Discrete Mathematics 113 (1993) 269-274. Let G be a k-regular, (k -I)-edge-connected graph with an even number of vertices, and let m be an integer such that 1~ m s k -1. Then the graph obtained by removing any k -m edges of G, has an m-factor.