Giovanni Lo Faro
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Giovanni Lo Faro has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Antoinette Tripodi
Dipartimento di Scienze Matematiche e Informatiche, Scienze Fisiche e Scienze della Terra, Università di Messina, 98166 Messina, Italy
35 shared publications Yanxun Chang
14 shared publications- Mario De Salvo
Dipartimento di Scienze Matematiche e Informatiche, Scienze Fisiche e Scienze della Terra, Università di Messina, 98122 Messina, Italy
12 shared publications - Salvatore Milici
Università di Catania
11 shared publications - Domenico Freni
Dipartimento di Scienze Matematiche, Informatiche e Fisiche, Università di Udine, 33100 Udine, Italy
9 shared publications - Dario Fasino
Dipartimento di Scienze Matematiche, Informatiche e Fisiche, Università di Udine, Udine, Italy
8 shared publications
Latest Publications
- Open Access
- 17 June 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (12) , 1879
Bi-Squashing S2,2-Designs into (K4 − e)-Designs
A double-star is the graph consisting of the union of two stars, and , together with an edge joining their centers. The spectrum for -designs, i.e., the set of all the such that an -design of the order n exists, is well-known when . In this article, -designs satisfying additional properties are investigated. We determine the spectrum for -designs that can be transformed into -designs by a double squash (bi-squash) passing through middle designs whose blocks are copies of a bull (the graph consisting of a triangle and two pendant edges). Here, the use of the difference method enables obtaining cyclic decompositions and determining the spectrum for cyclic -designs that can be purely bi-squashed into cyclic -designs (the middle bull designs are also cyclic).- 17 June 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (12) , 1879
Open AccessBi-Squashing S2,2-Designs into (K4 − e)-Designs
A double-star is the graph consisting of the union of two stars, and , together with an edge joining their centers. The spectrum for -designs, i.e., the set of all the such that an -design of the order n exists, is well-known when . In this article, -designs satisfying additional properties are investigated. We determine the spectrum for -designs that can be transformed into -designs by a double squash (bi-squash) passing through middle designs whose blocks are copies of a bull (the graph consisting of a triangle and two pendant edges). Here, the use of the difference method enables obtaining cyclic decompositions and determining the spectrum for cyclic -designs that can be purely bi-squashed into cyclic -designs (the middle bull designs are also cyclic). - Open Access
- 11 August 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (16) , 3479
Uniform {Ch,S(Ch)}-Factorizations of Kn−I for Even h
Let H be a connected subgraph of a graph G. An H-factor of G is a spanning subgraph of G whose components are isomorphic to H. Given a set of mutually non-isomorphic graphs, a uniform -factorization of G is a partition of the edges of G into H-factors for some . In this article, we give a complete solution to the existence problem of uniform -factorizations of (the graph obtained by removing a 1-factor from the complete graph ) for , where is a cycle of length an even integer and is the graph consisting of the cycle with a pendant edge attached to each vertex.- 11 August 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (16) , 3479
Open AccessUniform {Ch,S(Ch)}-Factorizations of Kn−I for Even h
Let H be a connected subgraph of a graph G. An H-factor of G is a spanning subgraph of G whose components are isomorphic to H. Given a set of mutually non-isomorphic graphs, a uniform -factorization of G is a partition of the edges of G into H-factors for some . In this article, we give a complete solution to the existence problem of uniform -factorizations of (the graph obtained by removing a 1-factor from the complete graph ) for , where is a cycle of length an even integer and is the graph consisting of the cycle with a pendant edge attached to each vertex. - Open Access
- 18 March 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (6) , 981
Commutativity and Completeness Degrees of Weakly Complete Hypergroups
We introduce a family of hypergroups, called weakly complete, generalizing the construction of complete hypergroups. Starting from a given group G, our construction prescribes the -classes of the hypergroups and allows some hyperproducts not to be complete parts, based on a suitably defined relation over G. The commutativity degree of weakly complete hypergroups can be related to that of the underlying group. Furthermore, in analogy to the degree of commutativity, we introduce the degree of completeness of finite hypergroups and analyze this degree for weakly complete hypergroups in terms of their -classes.- 18 March 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (6) , 981
Open AccessCommutativity and Completeness Degrees of Weakly Complete Hypergroups
We introduce a family of hypergroups, called weakly complete, generalizing the construction of complete hypergroups. Starting from a given group G, our construction prescribes the -classes of the hypergroups and allows some hyperproducts not to be complete parts, based on a suitably defined relation over G. The commutativity degree of weakly complete hypergroups can be related to that of the underlying group. Furthermore, in analogy to the degree of commutativity, we introduce the degree of completeness of finite hypergroups and analyze this degree for weakly complete hypergroups in terms of their -classes. - Open Access
- 15 March 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (6) , 936
Uniform (Ck, Pk+1)-Factorizations of Kn − I When k Is Even
Let H be a connected subgraph of a graph G. An H-factor of G is a spanning subgraph of G whose components are isomorphic to H. Given a set of mutually non-isomorphic graphs, a uniform -factorization of G is a partition of the edges of G into H-factors for some . In this article, we give a complete solution to the existence problem for uniform -factorizations of in the case when k is even.- 15 March 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (6) , 936
Open AccessUniform (Ck, Pk+1)-Factorizations of Kn − I When k Is Even
Let H be a connected subgraph of a graph G. An H-factor of G is a spanning subgraph of G whose components are isomorphic to H. Given a set of mutually non-isomorphic graphs, a uniform -factorization of G is a partition of the edges of G into H-factors for some . In this article, we give a complete solution to the existence problem for uniform -factorizations of in the case when k is even. - Open Access
- 13 January 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (2) , 240
G-Hypergroups: Hypergroups with a Group-Isomorphic Heart
Hypergroups can be subdivided into two large classes: those whose heart coincide with the entire hypergroup and those in which the heart is a proper sub-hypergroup. The latter class includes the family of 1-hypergroups, whose heart reduces to a singleton, and therefore is the trivial group. However, very little is known about hypergroups that are neither 1-hypergroups nor belong to the first class. The goal of this work is to take a first step in classifying G-hypergroups, that is, hypergroups whose heart is a nontrivial group. We introduce their main properties, with an emphasis on G-hypergroups whose the heart is a torsion group. We analyze the main properties of the stabilizers of group actions of the heart, which play an important role in the construction of multiplicative tables of G-hypergroups. Based on these results, we characterize the G-hypergroups that are of type U on the right or cogroups on the right. Finally, we present the hyperproduct tables of all G-hypergroups of size not larger than 5, apart of isomorphisms.
- 13 January 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (2) , 240
Open AccessG-Hypergroups: Hypergroups with a Group-Isomorphic Heart
Hypergroups can be subdivided into two large classes: those whose heart coincide with the entire hypergroup and those in which the heart is a proper sub-hypergroup. The latter class includes the family of 1-hypergroups, whose heart reduces to a singleton, and therefore is the trivial group. However, very little is known about hypergroups that are neither 1-hypergroups nor belong to the first class. The goal of this work is to take a first step in classifying G-hypergroups, that is, hypergroups whose heart is a nontrivial group. We introduce their main properties, with an emphasis on G-hypergroups whose the heart is a torsion group. We analyze the main properties of the stabilizers of group actions of the heart, which play an important role in the construction of multiplicative tables of G-hypergroups. Based on these results, we characterize the G-hypergroups that are of type U on the right or cogroups on the right. Finally, we present the hyperproduct tables of all G-hypergroups of size not larger than 5, apart of isomorphisms.
- 1 July 2021
- Published by Elsevier in Discrete Mathematics
- Vol. 344 (7)
Minimum embedding of any Steiner triple system into a 3-sun system via matchings
- 1 July 2021
- Published by Elsevier in Discrete Mathematics
- Vol. 344 (7)
Minimum embedding of any Steiner triple system into a 3-sun system via matchings
- Open Access
- 6 January 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (2) , 108
1-Hypergroups of Small Sizes
In this paper, we show a new construction of hypergroups that, under appropriate conditions, are complete hypergroups or non-complete 1-hypergroups. Furthermore, we classify the 1-hypergroups of size 5 and 6 based on the partition induced by the fundamental relation . Many of these hypergroups can be obtained using the aforesaid hypergroup construction.- 6 January 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (2) , 108
Open Access1-Hypergroups of Small Sizes
In this paper, we show a new construction of hypergroups that, under appropriate conditions, are complete hypergroups or non-complete 1-hypergroups. Furthermore, we classify the 1-hypergroups of size 5 and 6 based on the partition induced by the fundamental relation . Many of these hypergroups can be obtained using the aforesaid hypergroup construction. - Open Access
- 13 October 2020
- Published by MDPI AG in Mathematics
- Vol. 8 (10) , 1755
Uniformly Resolvable Decompositions of Kv-I into n-Cycles and n-Stars, for Even n
If X is a connected graph, then an X-factor of a larger graph is a spanning subgraph in which all of its components are isomorphic to X. Given a set of pairwise non-isomorphic graphs, a uniformly resolvable Γ-decomposition of a graph G is an edge decomposition of G into X-factors for some graph . In this article we completely solve the existence problem for decompositions of -I into -factors and -factors in the case when n is even.- 13 October 2020
- Published by MDPI AG in Mathematics
- Vol. 8 (10) , 1755
Open AccessUniformly Resolvable Decompositions of Kv-I into n-Cycles and n-Stars, for Even n
If X is a connected graph, then an X-factor of a larger graph is a spanning subgraph in which all of its components are isomorphic to X. Given a set of pairwise non-isomorphic graphs, a uniformly resolvable Γ-decomposition of a graph G is an edge decomposition of G into X-factors for some graph . In this article we completely solve the existence problem for decompositions of -I into -factors and -factors in the case when n is even. - Open Access
Minimum embedding of any Steiner triple system into a 3-sun system via matchings
Let $G$ be a simple finite graph and $G'$ be a subgraph of $G$. A $G'$-design $(X,\cal B)$ of order $n$ is said to be embedded into a $G$-design $(X\cup U,\cal C)$ of order $n+u$, if there is an injective function $f:\cal B\rightarrow \cal C$ such that $B$ is a subgraph of $f(B)$ for every $B\in\cal B$. The function $f$ is called an embedding of $(X,\cal B)$ into $(X\cup U,\cal C)$. If $u$ attains the minimum possible value, then $f$ is a minimum embedding. Here, by means of K\"{o}nig's Line Coloring Theorem and edge coloring properties a complete solution is given to the problem of determining a minimum embedding of any $K_3$-design (well-known as Steiner Triple System or, shortly, STS) into a 3-sun system or, shortly, a 3SS (i.e., a $G$-design where $G$ is a graph on six vertices consisting of a triangle with three pendant edges which form a 1-factor).Open AccessMinimum embedding of any Steiner triple system into a 3-sun system via matchings
Let $G$ be a simple finite graph and $G'$ be a subgraph of $G$. A $G'$-design $(X,\cal B)$ of order $n$ is said to be embedded into a $G$-design $(X\cup U,\cal C)$ of order $n+u$, if there is an injective function $f:\cal B\rightarrow \cal C$ such that $B$ is a subgraph of $f(B)$ for every $B\in\cal B$. The function $f$ is called an embedding of $(X,\cal B)$ into $(X\cup U,\cal C)$. If $u$ attains the minimum possible value, then $f$ is a minimum embedding. Here, by means of K\"{o}nig's Line Coloring Theorem and edge coloring properties a complete solution is given to the problem of determining a minimum embedding of any $K_3$-design (well-known as Steiner Triple System or, shortly, STS) into a 3-sun system or, shortly, a 3SS (i.e., a $G$-design where $G$ is a graph on six vertices consisting of a triangle with three pendant edges which form a 1-factor). - Open Access
On Hypergroups with a β-Class of Finite Height
In every hypergroup, the equivalence classes modulo the fundamental relation are the union of hyperproducts of element pairs. Making use of this property, we introduce the notion of height of a -class and we analyze properties of hypergroups where the height of a -class coincides with its cardinality. As a consequence, we obtain a new characterization of 1-hypergroups. Moreover, we define a hierarchy of classes of hypergroups where at least one -class has height 1 or cardinality 1, and we enumerate the elements in each class when the size of the hypergroups is , apart from isomorphisms.Open AccessOn Hypergroups with a β-Class of Finite Height
In every hypergroup, the equivalence classes modulo the fundamental relation are the union of hyperproducts of element pairs. Making use of this property, we introduce the notion of height of a -class and we analyze properties of hypergroups where the height of a -class coincides with its cardinality. As a consequence, we obtain a new characterization of 1-hypergroups. Moreover, we define a hierarchy of classes of hypergroups where at least one -class has height 1 or cardinality 1, and we enumerate the elements in each class when the size of the hypergroups is , apart from isomorphisms.