Cyclic and Dihedral 1-Factorizations of Multipartite Graphs
نویسندگان
چکیده
منابع مشابه
Cyclic and Dihedral 1-Factorizations of Multipartite Graphs
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.
متن کاملFair 1-Factorizations and Fair Holey 1-Factorizations of Complete Multipartite Graphs
A k-factor of a graph G is a k-regular spanning subgraph of G. A k-factorization is a partition of E(G) into k-factors. Let K(n, p) be the complete multipartite graph with p parts, each of size n. If V1, ..., Vp are the p parts of V (K(n, p)), then a holey k-factor of deficiency Vi of K(n, p) is a k-factor of K(n, p)− Vi for some i satisfying 1 ≤ i ≤ p. Hence a holey k-factorization is a set of...
متن کاملSharply Transitive 1-Factorizations of Complete Multipartite Graphs
Given a finite group G of even order, which graphs Γ have a 1−factorization admitting G as automorphism group with a sharply transitive action on the vertex-set? Starting from this question, we prove some general results and develop an exhaustive analysis when Γ is a complete multipartite graph and G is cyclic.
متن کاملBipartite 2-Factorizations of Complete Multipartite Graphs
It is shown that if K is any regular complete multipartite graph of even degree, and F is any bipartite 2-factor of K, then there exists a factorisation of K into F ; except that there is no factorisation of K6,6 into F when F is the union of two disjoint 6-cycles.
متن کاملHamilton Cycle Rich 2-factorizations of Complete Multipartite Graphs
For any two 2-regular spanning subgraphs G and H of the complete multipartite graph K, necessary and sufficient conditions are found for the existence of a 2-factorization of K in which (1) the first and second 2-factors are isomorphic to G and H respectively, and (2) each other 2-factor is a hamilton cycle, in the case where K has an odd number of vertices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2011
ISSN: 1077-8926
DOI: 10.37236/666