We give necessary and sufficient conditions that the complete graph K, has an isomorphic factorization into Kr X K,. We show that this factorization has an application to clone library screening.
Hamiltonian factorization of the product of a complete graph with itself
β Scribed by B. R. Myers
- Publisher
- John Wiley and Sons
- Year
- 1972
- Tongue
- English
- Weight
- 372 KB
- Volume
- 2
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract Let __Z__~__p__~ denote the cyclic group of order __p__ where __p__ is a prime number. Let __X__ = __X__(__Z__~__p__~, __H__) denote the Cayley digraph of __Z__~__p__~ with respect to the symbol __H__. We obtain a necessary and sufficient condition on __H__ so that the complete graph on
## Abstract A 1βfactorization is constructed for the line graph of the complete graph __K~n~__ when __n__ is congruent to 0 or 1 modulo 4.
The hamiltonian path graph H(F) of a graph F is that graph having the same vertex set as F and in which two vertices u and u are adjacent if and only if F contains a hamiltonian u -u path. First, in response to a conjecture of Chartrand, Kapoor and Nordhaus, a characterization of nonhamiltonian grap