Back to Search
Start Over
Resolvable gregarious cycle decompositions of complete equipartite graphs
- Source :
-
Discrete Mathematics . Jul2008, Vol. 308 Issue 13, p2844-2853. 10p. - Publication Year :
- 2008
-
Abstract
- Abstract: The complete multipartite graph with n parts of size m is shown to have a decomposition into n-cycles in such a way that each cycle meets each part of ; that is, each cycle is said to be gregarious. Furthermore, gregarious decompositions are given which are also resolvable. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 0012365X
- Volume :
- 308
- Issue :
- 13
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 31679533
- Full Text :
- https://doi.org/10.1016/j.disc.2006.06.047