Zobrazeno 1 - 10
of 49
pro vyhledávání: '"Alfredo Donno"'
Publikováno v:
International Journal of Group Theory, Vol 12, Iss 2, Pp 55-66 (2023)
Graph automaton groups constitute a special class of automaton groups constructed from a graph. In this paper, we show that the action of any graph automaton group on each level of the rooted regular tree gives rise to a Gelfand pair. In particular,
Externí odkaz:
https://doaj.org/article/c192fcbe9b43439e93497ae2bb0815a0
Publikováno v:
Advances in Group Theory and Applications, Vol 11, Pp 75-112 (2021)
In this paper we define a way to get a bounded invertible automaton starting from a finite graph. It turns out that the corresponding automaton group is regular weakly branch over its commutator subgroup, contains a free semigroup on two elements and
Externí odkaz:
https://doaj.org/article/47dd89610bec4a34952982d112e23147
Publikováno v:
International Journal of Group Theory, Vol 9, Iss 2, Pp 69-80 (2020)
Fragile words have been already considered in the context of automata groups. Here we focus our attention on a special class of strongly fragile words that we call Catalan fragile words. Among other properties, we show that there
Externí odkaz:
https://doaj.org/article/cfc2ee402ea541a3b59da03cc7f3a86e
Publikováno v:
Atti della Accademia Peloritana dei Pericolanti : Classe di Scienze Fisiche, Matematiche e Naturali, Vol 96, Iss S2, p A1 (2018)
Graph products and the corresponding spectra are often studied in the literature. A special attention has been given to the wreath product of two graphs, which is derived from the homonymous product of groups. Despite a general formula for the spectr
Externí odkaz:
https://doaj.org/article/0c30a7b63f504fc58271a2cb3adedd19
Autor:
Alfredo Donno
Publikováno v:
International Journal of Group Theory, Vol 2, Iss 1, Pp 11-35 (2013)
We investigate two constructions - the replacement and the zig-zag product of graphs - describing several fascinating connections with Combinatorics, via the notion of expander graph, Group Theory, via the notion of semidirect product and Cayley grap
Externí odkaz:
https://doaj.org/article/7c2b37a8990e491e9b740e5f3636d190
Publikováno v:
Discrete Applied Mathematics. 307:32-49
We determine the exact value of the Wiener index, the edge-Wiener index, and the vertex-edge-Wiener index of the Basilica graphs, i.e., the sequence of finite Schreier graphs associated with the action of the Basilica group on the rooted binary tree.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0786327d90e7ca76b21f949e17dfe3af
https://doi.org/10.1016/j.dam.2021.09.025
https://doi.org/10.1016/j.dam.2021.09.025
Publikováno v:
Linear Algebra and its Applications. 614:256-269
In this paper we describe two methods, both inspired from Godsil-McKay switching on simple graphs, to build cospectral gain graphs whose gain group consists of the complex numbers of modulus 1 (the circle group). The results obtained here can be also
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::759f7707e32b5d4176feb694501cc948
https://doi.org/10.1016/j.laa.2020.04.025
https://doi.org/10.1016/j.laa.2020.04.025
Publikováno v:
Linear Algebra and its Applications. 613:241-270
Let $G$ be an arbitrary group. We define a gain-line graph for a gain graph $(\Gamma,\psi)$ through the choice of an incidence $G$-phase matrix inducing $\psi$. We prove that the switching equivalence class of the gain function on the line graph $L(\
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d071bd66355e3fdfecd459533df6a123
https://doi.org/10.1016/j.laa.2020.11.009
https://doi.org/10.1016/j.laa.2020.11.009
This paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the associated semigroup, proving that it is isomorphic to the p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ba239345b0cdc5238297c6a01b7c35ec
http://arxiv.org/abs/2205.09035
http://arxiv.org/abs/2205.09035
Autor:
Matteo Cavaleri, Alfredo Donno
Publikováno v:
Ars Mathematica Contemporanea. 19:311-324
For every probability $p\in[0,1]$ we define a distance-based graph property, the $p$TS-distance-balancedness, that in the case $p=0$ coincides with the standard distance-balancedness, and in the case $p=1$ is related to the Hamiltonian-connectedness.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2814289cf31e951fcd5c03a384a35210
https://doi.org/10.26493/1855-3974.2096.c9d
https://doi.org/10.26493/1855-3974.2096.c9d