Blocking sets for cycles and paths designs
-
Published:2020
Issue:1
Volume:14
Page:183-197
-
ISSN:1452-8630
-
Container-title:Applicable Analysis and Discrete Mathematics
-
language:en
-
Short-container-title:APPL ANAL DISCRETE M
Author:
Bonacini Paola1,
Marino Lucia1
Affiliation:
1. Universitá degli Studi di Catania Viale A. Doria, Catania, Italy
Abstract
In this paper, we study blocking sets for C4, P3 and P5-designs. In the case of C4-designs and P3-designs we determine the cases in which the blocking sets have the largest possible range of cardinalities. These designs are called largely blocked. Moreover, a blocking set T for a G-design is called perfect if in any block the number of edges between elements of T and elements in the complement is equal to a constant. In this paper, we consider perfect blocking sets for C4-designs and P5-designs.
Publisher
National Library of Serbia
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics,Analysis