An automorphism group G of a 1-factorization of the complete multipartite graph Km×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 Km×n admitting a cyclic or dihedral group acting sharply transitively on the vertices of the graph.
Cyclic and dihedral 1-factorizations of complete multipartite graphs / M., Bogaerts; Mazzuoccolo, Giuseppe. - In: ELECTRONIC JOURNAL OF COMBINATORICS. - ISSN 1077-8926. - ELETTRONICO. - 18:1(2011), pp. P179-P179. [10.37236/666]
Cyclic and dihedral 1-factorizations of complete multipartite graphs
MAZZUOCCOLO, Giuseppe
2011
Abstract
An automorphism group G of a 1-factorization of the complete multipartite graph Km×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 Km×n admitting a cyclic or dihedral group acting sharply transitively on the vertices of the graph.
| File | Dimensione | Formato | |
|---|---|---|---|
|
666-PDF file-726-1-10-20120107.pdf
Open access
Tipologia:
VOR - Versione pubblicata dall'editore
Dimensione
118.66 kB
Formato
Adobe PDF
|
118.66 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
