Zobrazeno 1 - 10
of 43
pro vyhledávání: '"Gloria Rinaldi"'
Autor:
Gloria Rinaldi
A $1-$factorization of a complete graph on $2n$ vertices is said to be $G-$regular if it posseses an automorphism group $G$ acting sharply transitively on the vertex-set. The problem of determining which groups can realize such a situation dates back
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::88904996983865b5dff2ef0dcb4fdf5a
Kirkman triple systems (KTSs) are among the most popular combinatorial designs and their existence has been settled a long time ago. Yet, in comparison with Steiner triple systems, little is known about their automorphism groups. In particular, there
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f99011bb84ae3ebb457192a2753d28ae
Autor:
Simona Bonvicini, Gloria Rinaldi
Publikováno v:
Journal of Combinatorial Designs. 26:12-26
A 1-factorization of the complete multigraph λK2n is said to be indecomposable if it cannot be represented as the union of 1-factorizations of λ0K2n and (λ−λ0)K2n, where λ0
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::94a9495800f0e686981ff02a214d063f
https://doi.org/10.1002/jcd.21589
https://doi.org/10.1002/jcd.21589
Autor:
Giuseppe Mazzuoccolo, Gloria Rinaldi
Brualdi and Hollingsworth conjectured in Brualdi and Hollingsworth (1996) that in any complete graph K 2 n , n ≥ 3 , which is properly colored with 2 n − 1 colors, the edge set can be partitioned into n edge disjoint rainbow spanning trees (where
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::425a6a40a72cc31aa619560f207ecfae
http://hdl.handle.net/11562/990936
http://hdl.handle.net/11562/990936
Publikováno v:
Journal of Combinatorial Designs. 22:231-251
A Hamiltonian cycle system of Kv (briefly, a HCS(v)) is 1-rotational under a (nec- essarily binary )g roupG if it admits G as an automorphism group acting sharply transitively on all but one vertex. We first prove that for any n ≥ 3 there exists a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ab7993aa117fa080638d5ac131741cfe
https://doi.org/10.1002/jcd.21352
https://doi.org/10.1002/jcd.21352
Autor:
Marco Buratti, Gloria Rinaldi
Publikováno v:
Discrete Mathematics. 309:4722-4726
We prove that in every cyclic cycle-decomposition of K2n−I (the cocktail party graph of order 2n) the number of cycle-orbits of odd length must have the same parity of n(n−1)/2. This gives, as corollaries, some useful non-existence results one of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e4312f463c6411c26e8d587e901a9748
https://doi.org/10.1016/j.disc.2008.05.042
https://doi.org/10.1016/j.disc.2008.05.042
Autor:
Paolo Giudici, Gloria Rinaldi
Publikováno v:
Journal of Food Engineering. 82:121-127
Traditional balsamic vinegar (TBV) is aged for a long time in a set of barrels arranged in decreasing scalar volume. New cooked must is added and aliquots of product are transferred from barrel to barrel every year; this procedure generates a blend o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::945f449418e16ea9501e80c6381a163d
https://doi.org/10.1016/j.jfoodeng.2007.01.014
https://doi.org/10.1016/j.jfoodeng.2007.01.014
Autor:
Marco, Buratti, Capparelli, Stefano, Francesca, Merola, Gloria, Rinaldi, Tommaso, Traetta, Buratti, Marco
We collect some old and new results on Hamiltonian cycle systems of the complete graph (or the complete graph minus a 1-factor) having an automorphism group that satisfies specific properties.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::77020747b463d5481c7d3c1f90c54411
https://hdl.handle.net/11380/944891
https://hdl.handle.net/11380/944891
Autor:
Gloria Rinaldi
Publikováno v:
Electronic Notes in Discrete Mathematics. 24:195-198
The problem of the existence of one–factorizations of complete graphs which admit an automorphism group fixing some vertices and acting regularly on the others is considered.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8d26b77ca7183da42b4dfe24c285bf7f
https://doi.org/10.1016/j.endm.2006.06.038
https://doi.org/10.1016/j.endm.2006.06.038
Autor:
Gloria Rinaldi, Arrigo Bonisoli
Publikováno v:
Graphs and Combinatorics. 21:187-195
Let m be an integer, m ? 2 and set n = 2 m . Let G be a non-cyclic group of order 2n admitting a cyclic subgroup of order n. We prove that G always admits a starter and so there exists a one---factorization [InlineMediaObject not available: see fullt
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e97906d695c2c521c08286c769ba95f9
https://doi.org/10.1007/s00373-004-0599-3
https://doi.org/10.1007/s00373-004-0599-3