𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An isomorphic factorization of the complete graph

✍ Scribed by F. K. Hwang

Publisher
John Wiley and Sons
Year
1995
Tongue
English
Weight
194 KB
Volume
19
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

Isomorphic factorization of the complete
Isomorphic factorization of the complete graph into Cayley digraphs
✍ G. L. Chia; Poh-Hwa Ong πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 151 KB

## 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

On isomorphic factorizations of circulan
On isomorphic factorizations of circulant graphs
✍ Brian Alspach; Danny Dyer; Donald L. Kreher πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 112 KB

## Abstract We investigate the conjecture that every circulant graph __X__ admits a __k__‐isofactorization for every __k__ dividing |__E__(__X__)|. We obtain partial results with an emphasis on small values of __k__. Β© 2006 Wiley Periodicals, Inc. J Combin Designs 14: 406–414, 2006

Remarks on the placeability of isomorphi
Remarks on the placeability of isomorphic trees in a complete graph
✍ Hasunuma, Toru; Shibata, Yukio πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 99 KB πŸ‘ 3 views

Let Tp be any tree of order p and A ( T p ) stand for the maximum degree of the vertices of Tp. We prove the following theorem. "If A(Tp) 5 pi, where p > 2i, then Tp is i-placeable in Kp" is true if and only if i = 1, 2, and 3. 0 1996 John Wiley & Sons, Inc. Suppose G is a graph and V ( G ) , E ( G