giovanni Lo Faro | University of Messina (original) (raw)
Related Authors
University of SALFORD, England, United Kingdom
Uploads
Papers by giovanni Lo Faro
Mathematics, Mar 15, 2022
Ars Mathematica Contemporanea, Mar 1, 2016
Journal of the Australian Mathematical Society, Oct 1, 1994
The Australasian Journal of Combinatorics, Dec 1, 1998
arXiv (Cornell University), Mar 5, 2015
Discrete Mathematics, Apr 1, 2015
Discrete Mathematics, Feb 1, 1993
Discrete Mathematics, Dec 1, 2015
arXiv (Cornell University), Mar 2, 2015
arXiv (Cornell University), Feb 27, 2014
Ars Combinatoria, 2011
ABSTRACT Informally, an ϵ-switchable G-design is a decomposition of the complete graph into subgr... more ABSTRACT Informally, an ϵ-switchable G-design is a decomposition of the complete graph into subgraphs of isomorphic copies of G which have the property that they remain a G-decomposition when ϵ-edge switches are made to the subgraphs. This paper determines the spectrum of ϵ-switchable G-design where G is a kite (a triangle with an edge attached) and ϵ takes t-edge, h-edge and l-edge.
Elsevier eBooks, 1986
Annals of Discrete Mathematics 30 (1986) 297-302 © Elsevier Science Publishers BV (North-Holland)... more Annals of Discrete Mathematics 30 (1986) 297-302 © Elsevier Science Publishers BV (North-Holland) 297 ON BLOCK SHARING STEINER QUADRUPLE SYSTEMS Giovanni LO FARO (*) Dipartimento di Matematica del 1'Universita, Via C. Battisti 90, 98100 MESSINA, Italy ...
Ars Mathematica Contemporanea, Sep 20, 2018
Discrete Mathematics, Sep 1, 2005
Ars Combinatoria, 2001
ABSTRACT The authors completely determine the set of numbers k such that there exists a pair of t... more ABSTRACT The authors completely determine the set of numbers k such that there exists a pair of twin bowtie systems (or twin near bowtie systems) intersecting in k bowties. The proof is constructive. A bowtie in a graph is a pair of triangles having exactly one vertex in common. A bowtie system is a set of edge disjoint bowties partitioning the edge set of a complete graph.
Mathematics, Mar 15, 2022
Ars Mathematica Contemporanea, Mar 1, 2016
Journal of the Australian Mathematical Society, Oct 1, 1994
The Australasian Journal of Combinatorics, Dec 1, 1998
arXiv (Cornell University), Mar 5, 2015
Discrete Mathematics, Apr 1, 2015
Discrete Mathematics, Feb 1, 1993
Discrete Mathematics, Dec 1, 2015
arXiv (Cornell University), Mar 2, 2015
arXiv (Cornell University), Feb 27, 2014
Ars Combinatoria, 2011
ABSTRACT Informally, an ϵ-switchable G-design is a decomposition of the complete graph into subgr... more ABSTRACT Informally, an ϵ-switchable G-design is a decomposition of the complete graph into subgraphs of isomorphic copies of G which have the property that they remain a G-decomposition when ϵ-edge switches are made to the subgraphs. This paper determines the spectrum of ϵ-switchable G-design where G is a kite (a triangle with an edge attached) and ϵ takes t-edge, h-edge and l-edge.
Elsevier eBooks, 1986
Annals of Discrete Mathematics 30 (1986) 297-302 © Elsevier Science Publishers BV (North-Holland)... more Annals of Discrete Mathematics 30 (1986) 297-302 © Elsevier Science Publishers BV (North-Holland) 297 ON BLOCK SHARING STEINER QUADRUPLE SYSTEMS Giovanni LO FARO (*) Dipartimento di Matematica del 1'Universita, Via C. Battisti 90, 98100 MESSINA, Italy ...
Ars Mathematica Contemporanea, Sep 20, 2018
Discrete Mathematics, Sep 1, 2005
Ars Combinatoria, 2001
ABSTRACT The authors completely determine the set of numbers k such that there exists a pair of t... more ABSTRACT The authors completely determine the set of numbers k such that there exists a pair of twin bowtie systems (or twin near bowtie systems) intersecting in k bowties. The proof is constructive. A bowtie in a graph is a pair of triangles having exactly one vertex in common. A bowtie system is a set of edge disjoint bowties partitioning the edge set of a complete graph.