A lambda-fold G-design is said to be alpha-resolvable if its blocks can be partitioned into classes such that every class contains each vertex exactly alpha times. In this paper we study the existence problem of an alpha-resolvable lambda-fold G-design of order v in the case when G is any connected subgraph of K-4 and prove that the necessary conditions for its existence are also sufficient.
α-resolvable λ-fold G-designs. Contrib. Discrete Math. 12 (2017), no. 1, 83–90.
Mario Gionfriddo;Salvatore Milici;
2017-01-01
Abstract
A lambda-fold G-design is said to be alpha-resolvable if its blocks can be partitioned into classes such that every class contains each vertex exactly alpha times. In this paper we study the existence problem of an alpha-resolvable lambda-fold G-design of order v in the case when G is any connected subgraph of K-4 and prove that the necessary conditions for its existence are also sufficient.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.
