Zobrazeno 1 - 10
of 44
pro vyhledávání: '"Antoinette Tripodi"'
Autor:
Giovanni Lo Faro, Antoinette Tripodi
Publikováno v:
Mathematics, Vol 12, Iss 12, p 1879 (2024)
A double-star Sq1,q2 is the graph consisting of the union of two stars, K1,q1 and K1,q2, together with an edge joining their centers. The spectrum for Sq1,q2-designs, i.e., the set of all the n∈N such that an Sq1,q2-design of the order n exists, is
Externí odkaz:
https://doaj.org/article/5d5c8c5ad52f4e8da4896693c8c5fad6
Publikováno v:
Mathematics, Vol 11, Iss 16, p 3479 (2023)
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 H of mutually non-isomorphic graphs, a uniform H-factorization of G is a partition of the edges of G into H-fac
Externí odkaz:
https://doaj.org/article/736a06d0f3d64cb994a0a952fef38909
Publikováno v:
Mathematics, Vol 10, Iss 6, p 936 (2022)
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 H of mutually non-isomorphic graphs, a uniform H-factorization of G is a partition of the edges of G into H-fac
Externí odkaz:
https://doaj.org/article/d3ab557119cb45aab34a021761ffe00d
Publikováno v:
Mathematics, Vol 8, Iss 10, p 1755 (2020)
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
Externí odkaz:
https://doaj.org/article/66398a1307074fd297fa436bfe3c7828
Publikováno v:
Atti della Accademia Peloritana dei Pericolanti : Classe di Scienze Fisiche, Matematiche e Naturali, Vol 96, Iss S2, p A9 (2018)
Given a collection of graphs H, a uniformly resolvable H-design of order v is a decomposition of the edges of K^v into isomorphic copies of graphs from H (also called blocks) in such a way that all blocks in a given parallel class are isomorphic to t
Externí odkaz:
https://doaj.org/article/5c13eb55726b4149bed4af1079fe4c77
Publikováno v:
Atti della Accademia Peloritana dei Pericolanti : Classe di Scienze Fisiche, Matematiche e Naturali, Vol 96, Iss S2, p A4 (2018)
We study the completion problem for simple k-Latin rectangles, which are a special case of the generalized latin rectangles studied for which embedding theorems are given by Andersen and Hilton (1980) in “Generalized Latin rectangles II: Embedding
Externí odkaz:
https://doaj.org/article/4759cf5ae4b24c02841ca36ed4564a03
Autor:
Francesco Belardo, Antoinette Tripodi
Publikováno v:
Atti della Accademia Peloritana dei Pericolanti : Classe di Scienze Fisiche, Matematiche e Naturali, Vol 96, Iss S2, p E1 (2018)
In this preface we give some details about the past Congress “HyGraDe 2017” and we briefly describe the academic career of Mario Gionfriddo, whose 70th birthday was celebrated during the congress.
Externí odkaz:
https://doaj.org/article/8ff0a23bc22c4e6c843bd72a4dac183c
Publikováno v:
Atti della Accademia Peloritana dei Pericolanti : Classe di Scienze Fisiche, Matematiche e Naturali, Vol LXXXVIII, Iss 2, p C1A1002003 (2010)
In this paper, we give two methods to construct large sets of disjoint compatible packings (LMP(1vC4)) on 6k+5 points. As a result, we prove that there exists an (LMP(1vC4)) for v=7i uj where i ≥ 0, j ≥ 1 and u ∈ {13, 19, 25, 31, 43, 67, 139, 1
Externí odkaz:
https://doaj.org/article/51f3867f81004fbfb6a540bda3bda533
There are ten configurations of two bowties that can arise in a bowtie system. The avoidance spectrum for three of these was determined in a previous paper (Aequat. Math. 85 (2013), 347-358). In this paper the avoidance spectrum for a further five co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fdfb76d81d5b6cc77da860ac487844fd
http://hdl.handle.net/11570/3236649
http://hdl.handle.net/11570/3236649
Publikováno v:
Mathematics, Vol 8, Iss 1755, p 1755 (2020)
Mathematics
Volume 8
Issue 10
Mathematics
Volume 8
Issue 10
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 &Gamma
of pairwise non-isomorphic graphs, a uniformly resolvable &Gamma
decomposition of a
of pairwise non-isomorphic graphs, a uniformly resolvable &Gamma
decomposition of a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5bdd0ff737b3d965054e64fcd140f224
https://www.mdpi.com/2227-7390/8/10/1755
https://www.mdpi.com/2227-7390/8/10/1755