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.
Blocking sets for cycles and paths designs
Bonacini P.;Marino L.
2020-01-01
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.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
AADM-Vol14-No1-183-197.pdf
accesso aperto
Tipologia:
Versione Editoriale (PDF)
Licenza:
PUBBLICO - Pubblico con Copyright
Dimensione
351.4 kB
Formato
Adobe PDF
|
351.4 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.