Resolvable gregarious cycle decompositions of complete equipartite graphs |
| |
| Authors: | Elizabeth J Billington |
| |
| Institution: | a Centre for Discrete Mathematics and Computing, Department of Mathematics, The University of Queensland, Queensland 4072, Australia
b Department of Discrete and Statistical Sciences, Allison Lab, Auburn University, Auburn, AL 36849-5307, USA |
| |
| Abstract: | The complete multipartite graph Kn(m) 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 Kn(m); that is, each cycle is said to be gregarious. Furthermore, gregarious decompositions are given which are also resolvable. |
| |
| Keywords: | Gregarious cycle decomposition Resolvable decomposition Complete multipartite graph |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
