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

Authors

  • Mario Gionfriddo Department of Mathematics and Computer Sciences, University of Catania, Italy
  • Salvatore Milici Departmentof Mathematics and Computer Science, University of Catania, Italy

DOI:

https://doi.org/10.11575/cdm.v10i1.62266

Keywords:

Resolvable graph decomposition, uniformly resolvable designs, paths

Abstract

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.

Downloads

Published

2015-07-31

Issue

Section

Articles