a b s t r a c tIn this paper, it is shown that, for every v ≡ 0(mod 12), there exists a uniformly resolvable decomposition of K v -I, the complete undirected graph minus a 1-factor, into r classes containing only copies of 2-stars and s classes containing only copies of kites if and onlyIt is also shown that a uniformly resolvable decomposition of K v into r classes containing only copies of 2-stars and s classes containing only copies of kites exists if and only if v ≡ 9(mod 12) and s = 0.
In this paper we consider the uniformly resolvable decompositions of the complete graph K v , or the complete graph minus a 1-factor as appropriate, into subgraphs such that each resolution class contains only blocks isomorphic to the same graph. We completely determine the spectrum for the case in which all the resolution classes are either P 3 or K 3 .
a b s t r a c tLet K v denote the complete graph of order v and K v − I denote K v minus a 1-factor. In this article we investigate uniformly resolvable decompositions of K v and K v − I into r classes containing only copies of 3-stars and s classes containing only copies of 3-cycles. We completely determine the spectrum in the case where the number of resolution classes of 3-stars is maximum.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.