Let Gυ u denote the graph Kυ\Ku if both u and υ are odd, and (Kυ–F1)\(Ku–F2) if both u and υ are even, where F1 is a 1-factor of Kυ and F2 is a 1-factor of Ku with F2⊆F1. In this paper, we study the existence problem of m-cycle design of Gυ u. By using direct and recurssive constructions, we obtain several new m-cycle design of Gυ u.
|Number of pages||13|
|Journal||Journal of Discrete Mathematical Sciences and Cryptography|
|State||Published - 17 Nov 2017|
- Holy design
- m-cycle design