## Abstract We consider __k__‐factorizations of the complete graph that are 1‐__rotational__ under an assigned group __G__, namely that admit __G__ as an automorphism group acting sharply transitively on all but one vertex. After proving that the __k__‐factors of such a factorization are pairwise i
A complete solution to the existence problem for 1-rotational k-cycle systems of Kv
✍ Scribed by Shung-Liang Wu; Marco Buratti
- Publisher
- John Wiley and Sons
- Year
- 2009
- Tongue
- English
- Weight
- 133 KB
- Volume
- 17
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
The necessary and sufficient conditions for the existence of a 1‐rotational k‐cycle system of the complete graph K~v~ are established. The proof provides an algorithm able to determine, directly and explicitly, an odd k‐cycle system of K~v~ whenever such a system exists. © 2009 Wiley Periodicals,
Inc. J Combin Designs 17: 283–293, 2009
📜 SIMILAR VOLUMES
## Abstract A new, rapid method is described which determines the absolute values of all the unknown parameters of an AB(1__k__,1ϕ) reactive system from experimental information about the change of absorbance with time at any given wavelength. The mathematical algorithm is given for the case where
## Information presentation and communication 23.5.26 (125790) Chang, M K, Choi, J H and Jung, E S 'Ergonomics considerations for the design of a CRT-based process control system' in Kumashiro, M and Megaw, D (eds) Towards human work: solutions to problems in occupational health and safety Taylor