Equipartite gregarious 6- and 8-cycle systems |
| |
Authors: | Elizabeth J Billington |
| |
Institution: | a Centre for Discrete Mathematics and Computing, Department of Mathematics, The University of Queensland, Qld. 4072, Australia b Department of Mathematics and Statistics, Auburn University, 221 Parker Hall, Auburn, AL 36849-5310, USA |
| |
Abstract: | A k-cycle decomposition of a complete multipartite graph is said to be gregarious if each k-cycle in the decomposition has its vertices in k different partite sets. Equipartite gregarious 3-cycle systems are 3-GDDs, and necessary and sufficient conditions for their existence are known (see for instance the CRC Handbook of Combinatorial Designs, 1996, C.J. Colbourn, J.H. Dinitz (Eds.), Section III 1.3). The cases of equipartite and of almost equipartite 4-cycle systems were recently dealt with by Billington and Hoffman. Here, for both 6-cycles and for 8-cycles, we give necessary and sufficient conditions for existence of a gregarious cycle decomposition of the complete equipartite graph Kn(a) (with n parts, n?6 or n?8, of size a). |
| |
Keywords: | Graph decomposition Gregarious cycle Complete multipartite graph Equipartite graph |
本文献已被 ScienceDirect 等数据库收录! |
|