✦ LIBER ✦

On one-factorizations of compositions of graphs

✍ Scribed by P. Himelwright; W. D. Wailis; J. E. Williamson

Publisher: John Wiley and Sons
Year: 1984
Tongue: English
Weight: 53 KB
Volume: 8
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190080122

No coin nor oath required. For personal study only.

✦ Synopsis

Lemma 2 of the paper asserts that if m is odd and s is odd then C,,,[R',J can be factorized into factors each of which is the point-disjoint union of one copy of C, with K s -1) copies of Cz,. We define certain cycles C,.,, , and our intention was that factor b (1 s b < s) would consist of all the cycles C r b , r b where x + z = b (mod s). Unfortunately the formula for this appears incorrectly in the paper (p. 77); in the 17th line, C l b . ( b -l ) b u C Z b . ( b -Z ) b u u C i b . ( b -i ) b c ( r + l ) b , ( b -r -l ) b r be rep1aced by 2r, or perhaps it would be better to write A corresponding change should also be made five lines later, in the formula for the case of s even. In this case, the line should be replaced by The authors thank Sun Hui-Cheng for pointing out the above typographical

📜 SIMILAR VOLUMES

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

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

Orthogonal factorizations of graphs

✍ Haodi Feng; Guizhen Liu 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB

## Abstract Let __G__ be a graph with vertex set __V__(__G__) and edge set __E__(__G__). Let __k__~1~, __k__~2~,…,__k__~m~ be positive integers. It is proved in this study that every [0,__k__~1~+…+__k__~__m__~−__m__+1]‐graph __G__ has a [0, __k__~i~]~1~^__m__^‐factorization orthogonal to any given

Cube factorizations of complete graphs

✍ Peter Adams; Darryn Bryant; Barbara Maenhaut 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 94 KB

## Abstract A cube factorization of the complete graph on __n__ vertices, __K~n~__, is a 3‐factorization of __K~n~__ in which the components of each factor are cubes. We show that there exists a cube factorization of __K~n~__ if and only if __n__ ≡ 16 (mod 24), thus providing a new family of unifor

One-factorizations of complete graphs wi

One-factorizations of complete graphs with vertex-regular automorphism groups

✍ Arrigo Bonisoli; Domenico Labbate 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB

## Abstract We consider one‐factorizations of __K__~2__n__~ possessing an automorphism group acting regularly (sharply transitively) on vertices. We present some upper bounds on the number of one‐factors which are fixed by the group; further information is obtained when equality holds in these boun

1-Factorizations of random regular graph

1-Factorizations of random regular graphs

✍ M. S. O. Molloy; H. Robalewska; R. W. Robinson; N. C. Wormald 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB 👁 2 views

It is shown that for each r G 3, a random r-regular graph on 2 n vertices is equivalent in a certain sense to a set of r randomly chosen disjoint perfect matchings of the 2 n vertices, as n ª ϱ. This equivalence of two sequences of probabilistic spaces, called contiguity, occurs when all events almo