✦ LIBER ✦

Perfect cyclic designs

✍ Scribed by N.S. Mendelsohn

Book ID: 107748234
Publisher: Elsevier Science
Year: 1977
Tongue: English
Weight: 616 KB
Volume: 20
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(77)90043-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Resolvable perfect cyclic designs

✍ F.E Bennett; E Mendelsohn; N.S Mendelsohn 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 523 KB

Perfect Cayley Designs as Generalization

Perfect Cayley Designs as Generalizations of Perfect Mendelsohn Designs

✍ Marco Buratti; Fulvio Zuanni 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 89 KB

Combinatorial designs and perfect codes

✍ Kevin T. Phelps 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 230 KB

Constructions of perfect Mendelsohn desi

Constructions of perfect Mendelsohn designs

✍ F.E. Bennett; K.T. Phelps; C.A. Rodger; L. Zhu 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 820 KB

of perfect Mendelsohn designs, Discrete Mathematics 103 (1992) 139-151. Let n and k be positive integers. An (n, k, 1)-Mendelsohn design is an ordered pair (V, %) where V is the vertex set of D,, the complete directed graph on n vertices, and '%' is a set of directed cycles (called blocks) of lengt

On GMW Designs and Cyclic Hadamard Desig

On GMW Designs and Cyclic Hadamard Designs

✍ Wen–Ai Jackson; Peter R. Wild 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 92 KB

Enumeration of cyclic graphs and cyclic

Enumeration of cyclic graphs and cyclic designs

✍ H.A David 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 316 KB