✦ LIBER ✦

On equationally defining m-perfect 2m + 1 cycle systems

✍ Scribed by C. C. Lindner; C. A. Rodger

Publisher: John Wiley and Sons
Year: 1994
Tongue: English
Weight: 434 KB
Volume: 2
Category: Article
ISSN: 1063-8539
DOI: 10.1002/jcd.3180020504

No coin nor oath required. For personal study only.

✦ Synopsis

In this article we give a complete solution to the problem of equationally defining m-perfect (2m + 1)-cycle systems and of equationally defining rn-perfect directed (2m + 1)-cycle systems.

📜 SIMILAR VOLUMES

On equationally defining extended cycle

On equationally defining extended cycle systems

✍ C.C. Lindner; C.A. Rodger 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 654 KB

It has been previously shown by Bryant and Lindner that the only values of m for which 2-perfect m-cycle systems can be equationally defined are m e {3, 5,7}. In this paper more general graph decompositions of an m-cycle system are defined, namely extended cycle systems, and it is shown that if m is

2-perfect directed m-cycle systems can b

2-perfect directed m-cycle systems can be equationally defined for m = 3,4, and 5 only

✍ Darryn E. Bryant; C.C. Lindner 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 414 KB

{2, 3}-perfect m-cycle systems are equat

{2, 3}-perfect m-cycle systems are equationally defined for m = 5, 7, 8, 9, and 11 only

✍ E. M. Li Marzi; C. C. Lindner; F. Rania; R. M. Wilson 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 133 KB

## Abstract An __m__‐cycle system (S__,C__) of order __n__ is said to be {2,3}‐perfect provided each pair of vertices is connected by a path of length 2 in an __m__‐cycle of __C__ and a path of length 3 in an __m__‐cycle of __C__. The class of {2,3}‐perfect __m__‐cycle systems is said to be equatio

2-perfect m-cycle systems

✍ C.C. Lindner; C.A. Rodger 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 530 KB

On single laws for varieties of groupoid

On single laws for varieties of groupoids associated with strongly 2-perfect m-cycle systems

✍ Abdollah Khodkar; Sarah Zahrai 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 118 KB

A partial m=(2k+1)-cycle system of order

A partial m=(2k+1)-cycle system of order n can be embedded in an m-cycle system of order (2n+1)m

✍ C.C. Lindner; C.A. Rodger 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 566 KB

A generalization of Cruse's Theorem on embedding partial idempotent commutative latin squares is developed and used to show that a partial m = (2k + I)-cycle system of order n can be embedded in an m-cycle system of order tm for every odd t 2 (2n + 1).