๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Perfect Cayley Designs as Generalizations of Perfect Mendelsohn Designs

โœ Scribed by Marco Buratti; Fulvio Zuanni


Book ID
110299281
Publisher
Springer
Year
2001
Tongue
English
Weight
89 KB
Volume
23
Category
Article
ISSN
0925-1022

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Constructions of perfect Mendelsohn desi
โœ 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

Perfect cyclic designs
โœ N.S. Mendelsohn ๐Ÿ“‚ Article ๐Ÿ“… 1977 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 616 KB
Resolvable perfect cyclic designs
โœ F.E Bennett; E Mendelsohn; N.S Mendelsohn ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 523 KB