✦ LIBER ✦

An association scheme for the 1-factors of the complete graph

✍ Scribed by B.M.I Rands

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 505 KB
Volume: 34
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(83)90064-x

No coin nor oath required. For personal study only.

📜 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.

Sharply transitive 1-factorizations of t

Sharply transitive 1-factorizations of the complete graph with an invariant 1-factor

✍ Gábor Korchmáros 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 682 KB

## Abstract We give some simple characterizations of those __n__ for which __K~n~__ has a sharply transitive 1‐factorization with an assigned automorphism group that acts sharply transitively on the vertex set and also fixes a 1‐factor. © 1994 John Wiley & Sons, Inc.

Nilpotent 1-factorizations of the comple

Nilpotent 1-factorizations of the complete graph

✍ Gloria Rinaldi 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 1 views

Abelian 1-Factorizations of the Complete

Abelian 1-Factorizations of the Complete Graph

✍ Marco Buratti 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 75 KB

Extending a result by Hartman and Rosa (1985, Europ. J. Combinatorics 6, 45-48), we prove that for any Abelian group G of even order, except for G Z 2 n with n > 2, there exists a onefactorization of the complete graph admitting G as a sharply-vertex-transitive automorphism group.

A 1-factorization of the line graphs of

A 1-factorization of the line graphs of complete graphs

✍ Brian Alspach 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 254 KB 👁 1 views

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

An algorithm for finding factorizations

An algorithm for finding factorizations of complete graphs

✍ A. J. W. Hilton; Matthew Johnson 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 58 KB 👁 1 views

## Abstract We show how to find a decomposition of the edge set of the complete graph into regular factors where the degree and edge‐connectivity of each factor is prescribed. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 132–136, 2003