Cyclic and dihedral 1-factorizations of multipartite graphs (Q640435)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5960041
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cyclic and dihedral 1-factorizations of multipartite graphs |
scientific article; zbMATH DE number 5960041 |
Statements
Cyclic and dihedral 1-factorizations of multipartite graphs (English)
0 references
18 October 2011
0 references
An automorphism group \(G\) of a \(1\)-factorization of the complete graph \(K_{m\times n}\) consists of permutations of the vertices of the graph mapping factors to factors. In this work is given a complete answer to the existence problem of a \(1\)-factorization of \(K_{m\times n}\) admitting a cycle or dihedral group acting sharply transitively on the vertices of the graph.
0 references
multipartite graphs
0 references
\(r\)-factor
0 references
perfect matching
0 references
0.9003621935844421
0 references
0.8487837314605713
0 references
0.8329600691795349
0 references
0.8329600691795349
0 references
0.8327630758285522
0 references
