We use Rosa-type labelings to decompose complete graphs into unicyclic, disconnected, bipartite graphs on nine edges - namely, those featuring cyclic component C4, C6, or C8. For any such graph H, we prove there exists an H-design of K18k+1 and K18k for all positive integers k.
机构:
Univ Stellenbosch, Dept Math Sci, Div Math, ZA-7602 Matieland, South AfricaUniv Stellenbosch, Dept Math Sci, Div Math, ZA-7602 Matieland, South Africa
机构:
Department of Applied Mathematics, Shanghai University of International Business and Economics, ShanghaiDepartment of Applied Mathematics, Shanghai University of International Business and Economics, Shanghai
Zhu J.
Yang J.
论文数: 0引用数: 0
h-index: 0
机构:
College of Finance, Shanghai University of International Business and Economics, ShanghaiDepartment of Applied Mathematics, Shanghai University of International Business and Economics, Shanghai