Let Kv denote the complete graph of order v and Kv - I denote Kv minus a 1-factor. In this article we investigate uniformly resolvable decompositions of Kv and Kv - 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.
- Resolvable graph decomposition
- Uniform resolutions
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics