On Resolvable Multipartite G-Designs II |
| |
| Authors: | MG Karunambigai A Muthusamy |
| |
| Institution: | (1) Department of Mathematics, Vellalar College for Women, Erode, 638 009, Tamilnadu, India;(2) Department of Mathematics, Sri Vasavi College, Erode, 638 316, Tamilnadu, India |
| |
| Abstract: | In this paper, it has been proved that  and  are  factorable, where ⊗ denotes wreath product of graphs. As a consequence, a resolvable (k,n,k,2λ) multipartite  –design exists for even k. These results generalize the results of Ushio on –factorizations of complete tripartite graphs. |
| |
| Keywords: | Cycle-factorization Wreath product of graphs Complete symmetric k− partite multi-digraph Resolvable multipartite G -design |
| 本文献已被 SpringerLink 等数据库收录！ |
|
