1. Cyclic and dihedral 1-factorizations of multipartite graphs
- Author
-
Giuseppe Mazzuoccolo and Mathieu Bogaerts
- Subjects
Discrete mathematics ,Applied Mathematics ,Symmetric graph ,Distance-regular graph ,Theoretical Computer Science ,Combinatorics ,Vertex-transitive graph ,Mathématiques ,Computational Theory and Mathematics ,Edge-transitive graph ,Discrete Mathematics and Combinatorics ,Multipartite graph ,Théorie des graphes ,Graph homomorphism ,Geometry and Topology ,Graph automorphism ,Turán graph ,Mathematics - Abstract
An automorphism group G of a 1-factorization of the complete multipartite graph K m×n consists of permutations of the vertices of the graph mapping factors to factors. In this paper, we give a complete answer to the existence problem of a 1-factorization of K m×n admitting a cyclic or dihedral group acting sharply transitively on the vertices of the graph., info:eu-repo/semantics/published
- Published
- 2011