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.
Cyclic and dihedral 1-factorizations of complete multipartite graphs
Mazzuoccolo, Giuseppe
2011-01-01
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.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
v18i1p179.pdf
accesso aperto
Descrizione: Articolo Principale
Tipologia:
Versione dell'editore
Licenza:
Accesso ristretto
Dimensione
118.66 kB
Formato
Adobe PDF
|
118.66 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
