Hamilton decompositions of balanced complete multipartite graphs with primitive leaves
Document Type
Article
Publication Date
7-28-2010
Abstract
A graph G is said to be primitive if it contains no proper factors. In this paper, by using the amalgamation technique, we find sufficient conditions for the existence of a d-regular graph G on n vertices which: 1.has a Hamilton decomposition, and2.has a complement in Kmp that is primitive. These general results are then used to consider the bounds on m when p and d are fixed. The case p = 6 for all m and d is considered in more detail. © 2010.
Publication Title
Discrete Mathematics
Recommended Citation
Ozkan, S.,
&
Rodger, C.
(2010).
Hamilton decompositions of balanced complete multipartite graphs with primitive leaves.
Discrete Mathematics,
310(13-14), 1965-1973.
http://doi.org/10.1016/j.disc.2010.03.006
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/6285