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