Resolvable h-sun designs

2015/03/05 by Mario Gionfriddo, Giovanni Lo Faro, Gionfriddo, Mario +5
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #Finite Group Theory Research #graph theory and CDMA systems #math.CO

paper · pdf · doi:10.48550/arxiv.1503.01690

arxiv created 2015/03/05 · arxiv updated 2015/03/06

Abstract

In this article we completely determine the spectrum for uniformly resolvable decompositions of the complete graph K_v into r 1-factors and s classes containing only copies of h-suns.

Related

• Uniformly resolvable (C₄, K_1,3)-designs of order v and index 2
• Maximum uniformly resolvable decompositions of K_v and K_v - I into 3-stars and 3-cycles
• Complex uniformly resolvable decompositions of K_v
• Uniformly resolvable decompositions of K_v into 1-factors and odd n-star factors
• Uniformly resolvable decompositions of K_v into one 1-factor and n-stars when n>1 is odd