Back to Search
Start Over
Equipartite gregarious 6- and 8-cycle systems
- Source :
-
Discrete Mathematics . Jun2007, Vol. 307 Issue 13, p1659-1667. 9p. - Publication Year :
- 2007
-
Abstract
- 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 (with n parts, or , of size a). [Copyright &y& Elsevier]
- Subjects :
- *MATHEMATICAL decomposition
*GRAPH theory
*GRAPHIC methods
*COMBINATORICS
Subjects
Details
- Language :
- English
- ISSN :
- 0012365X
- Volume :
- 307
- Issue :
- 13
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 24612557
- Full Text :
- https://doi.org/10.1016/j.disc.2006.09.016