1 citations · 1 across the 6 of their papers we have counts for
7 papers
Minimum embedding of any Steiner triple system into a 3-sun system via matchings
Giovanni Lo Faro, Antoinette Tripodi
Let be a simple finite graph and be a subgraph of . A -design of order is said to be embedded into a -design of order ,…
The Doyen-Wilson theorem for 3-sun systems
Giovanni Lo Faro, Antoinette Tripodi
A solution to the existence problem of G-designs with given subdesigns is known when G is a triangle with p=0,1, or 2 disjoint pendent edges: for p=0, it is due to Doyen and Wilson…
Resolvable h-sun designs
Mario Gionfriddo, Giovanni Lo Faro, Salvatore Milici +1
In this article we completely determine the spectrum for uniformly resolvable decompositions of the complete graph K_v into r 1-factors and s classes containing only copies of h-su…
Resolvable G-designs of order v and index λ
Mario Gionfriddo, Giovanni Lo Faro, Salvatore Milici +1
In this paper we consider the problem concerning the existence of a resolvable G-design of order v and index λ. We solve the problem for the cases in which G is a connected subgrap…
Uniformly resolvable decompositions of K_v into paths on two, three and four vertices
Giovanni Lo Faro, Salvatore Milici, Antoinette Tripodi
In this paper we consider uniformly resolvable decompositions of the complete graph K_v into subgraphs such that each resolution class contains only blocks isomorphic to the same g…
Enumerations of (K_4-e)-designs with small orders
Yanxun Chang, Tao Feng, Giovanni Lo Faro +1
It is established that up to isomorphism,there are only one (K_4-e)-design of order 6, three (K_4-e)-designs of order 10 and two (K_4-e)-designs of order 11. As an application of o…
Resolvable 3-star designs
Selda Kucukcifci, Giovanni Lo faro, Salvatore Milici +1
Let Kv be the complete graph of order v and F be a set of 1-factors of Kv. In this article we study the existence of a resolvable decomposition of Kv - F into 3-stars when F has th…