Closed trail decompositions of complete equipartite graphs |
| |
| Authors: | Andrea Burgess Mateja Šajna |
| |
| Affiliation: | Department of Mathematics and Statistics, University of Ottawa, 585 King Edward Ave., Ottawa, ON K1N 6N5, Canada |
| |
| Abstract: | ![]()
The complete equipartite graph $K_m * {overline{K_n}}$ has mn vertices partitioned into m parts of size n, with two vertices adjacent if and only if they are in different parts. In this paper, we determine necessary and sufficient conditions for the existence of a decomposition of $K_m * {overline{K_n}}$ into closed trails of length k. © 2009 Wiley Periodicals, Inc. J Combin Designs 17: 374–403, 2009 |
| |
| Keywords: | complete multipartite graph decomposition closed trail |
|
|
