If H (3) is an hypergraph uniform of rank 3, an H (3) -decomposition of (3) the complete hypergraph K v is a collection of hypergraphs H (3) , whose (3) (3) edge-sets partition the edge-set of K v . An H (3) -decomposition of K v is also called an H (3) -design and the hypergraphs of the partition are said the blocks. An H (3) -design is said to be balanced if the number of (3) blocks containing any given vertex of Kv is constant. In this paper, we give some double constructions to obtain non-cyclic balanced P (3) (1, 5)- designs of order v, starting from balanced P (3) (1, 5)-designs of order v/2.
Construction of non-cyclic balanced P(3)(1,5)-designs
BONACINI, PAOLA;GIONFRIDDO, Mario;MARINO, LUCIA MARIA
2015-01-01
Abstract
If H (3) is an hypergraph uniform of rank 3, an H (3) -decomposition of (3) the complete hypergraph K v is a collection of hypergraphs H (3) , whose (3) (3) edge-sets partition the edge-set of K v . An H (3) -decomposition of K v is also called an H (3) -design and the hypergraphs of the partition are said the blocks. An H (3) -design is said to be balanced if the number of (3) blocks containing any given vertex of Kv is constant. In this paper, we give some double constructions to obtain non-cyclic balanced P (3) (1, 5)- designs of order v, starting from balanced P (3) (1, 5)-designs of order v/2.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.