Maximum uniformly resolvable decompositions of K_v and K_v - I into 3-stars and 3-cycles

2013/10/28 by Selda Küçükçifçi, Küçükçifçi, Selda, Salvatore Milici +3 · 1 citation
Mathematics · #05B05 #05C51 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05B05 #msc:05C51

paper · pdf · doi:10.48550/arxiv.1310.7403

arxiv created 2013/10/28 · arxiv updated 2013/10/29

Abstract

Let 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.

Cited by

• Resolvable 3-star designs

Related

• Uniformly resolvable decompositions of K_v into P₃ and K₃ graphs
• Uniformly resolvable decompositions of K_v into one 1-factor and n-stars when n>1 is odd
• Uniformly resolvable decompositions of K_v-I into 5-stars
• Uniformly resolvable decompositions of K_v into 1-factors and odd n-star factors
• Complex uniformly resolvable decompositions of K_v