On uniformly resolvable {K_2, P_k}-designs with with k=3,4

Contributions to Discrete Mathematics

Mario Gionfriddo²  Salvatore Milici¹ 

[1] Departmentof Mathematics and Computer Science, University of Catania, Italy;Department of Mathematics and Computer Sciences, University of Catania, Italy

关键词: Resolvable graph decomposition;    uniformly resolvable designs;    paths;   

DOI  :  

学科分类：社会科学、人文和艺术（综合）

来源: University of Calgary * Department of Mathematics and Statistics

【 摘 要 】

Given a collection of graphs H, a uniformly resolvable H-design of order v is a decomposition of the edges of K_v into isomorphic copies of graphs from H (also called blocks)  in such a way that all blocks in a given parallel class are isomorphic to the same graph from H. We consider the case H={K_2, P_k}  with k=3,4, and determine the spectrum completely.

【 授权许可】

Unknown