𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On isomorphic factorizations of circulant graphs

✍ Scribed by Brian Alspach; Danny Dyer; Donald L. Kreher

Publisher
John Wiley and Sons
Year
2006
Tongue
English
Weight
112 KB
Volume
14
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

✦ Synopsis

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

πŸ“œ SIMILAR VOLUMES

An isomorphic factorization of the compl
An isomorphic factorization of the complete graph
✍ F. K. Hwang πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 194 KB

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.

On one-factorizations of compositions of
On one-factorizations of compositions of graphs
✍ P. Himelwright; W. D. Wallis; J. E. Williamson πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 223 KB πŸ‘ 1 views

## Abstract Let __G__[__H__] denote the composition of the graphs __G__ and __H.__ If __G__ can be decomposed into one‐factors and two‐factors, __H__ can be decomposed into one‐factors, and __H__ is not the empty graph on an odd number of vertices, then __G__[__H__] can be decomposed into one‐facto