Premium
Covering 2‐paths uniformly
Author(s) -
Heinrich K.,
Langdeau D.,
Verrall H.
Publication year - 2000
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/(sici)1520-6610(2000)8:2<100::aid-jcd3>3.0.co;2-e
Subject(s) - mathematics , combinatorics , graph , cover (algebra) , set (abstract data type) , discrete mathematics , computer science , mechanical engineering , engineering , programming language
We survey the existence of designs which consist of a set of subgraphs H i of a graph G that between them uniformly cover the 2‐paths of G , such that the H i are all isomorphic to a given subgraph H of G . We also construct several new designs in this family. © 2000 John Wiley & Sons, Inc. J Combin Designs 8: 100–121, 2000