23 citations · 187 across the 26 of their papers we have counts for
29 papers
Godsil-McKay switchings for gain graphs
Matteo Cavaleri, Alfredo Donno, Stefano Spessato
We introduce a switching operation, inspired by the Godsil-McKay switching, in order to obtain pairs of -cospectral gain graphs, that are gain graphs cospectral with respect to…
On a class of poly-context-free groups generated by automata
Matteo Cavaleri, Daniele D'Angeli, Alfredo Donno +1
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 charact…
On cospectrality of gain graphs
Matteo Cavaleri, Alfredo Donno
We define -cospectrality of two -gain graphs and , proving that it is a switching isomorphism invariant. When is a finite group, we prove that -cospec…
On an uncountable family of graphs whose spectrum is a Cantor set
Matteo Cavaleri, Daniele D'Angeli, Alfredo Donno +1
For each , the star automaton group is an automaton group which can be defined starting from a star graph on vertices. We study Schreier graphs a…
Characterizations of line graphs in signed and gain graphs
Matteo Cavaleri, Daniele D'Angeli, Alfredo Donno
We generalize three classical characterizations of line graphs to line graphs of signed and gain graphs: the Krausz's characterization, the van Rooij and Wilf's characterization an…
Gain-line graphs via -phases and group representations
Matteo Cavaleri, Daniele D'Angeli, Alfredo Donno
Let be an arbitrary group. We define a gain-line graph for a gain graph through the choice of an incidence -phase matrix inducing . We prove that the switching eq…
Graph automaton groups
Matteo Cavaleri, Daniele D'Angeli, Alfredo Donno +1
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…
A group representation approach to balance of gain graphs
Matteo Cavaleri, Daniele D'Angeli, Alfredo Donno
We study the balance of -gain graphs, where is an arbitrary group, by investigating their adjacency matrices and their spectra. As a first step, we characterize switching eq…
Constructing cospectral signed graphs
Francesco Belardo, Maurizio Brunetti, Matteo Cavaleri +1
A well--known fact in Spectral Graph Theory is the existence of pairs of isospectral nonisomorphic graphs (known as PINGS). The work of A.J. Schwenk (in 1973) and of C. Godsil and…
Distance-balanced graphs and Travelling Salesman Problems
Matteo Cavaleri, Alfredo Donno
For every probability we define a distance-based graph property, the TS-distance-balancedness, that in the case coincides with the standard distance-balancedne…
Permutational powers of a graph
Matteo Cavaleri, Daniele D'Angeli, Alfredo Donno
This paper introduces a new graph construction, the permutational power of a graph, whose adjacency matrix is obtained by the composition of a permutation matrix with the adjacency…
Some degree and distance-based invariants of wreath products of graphs
Matteo Cavaleri, Alfredo Donno
The wreath product of graphs is a graph composition inspired by the notion of wreath product of groups, with interesting connections with Geometric Group Theory and Probability. Th…
Computing the Wiener index in Sierpinski carpet graphs
Daniele D'Angeli, Alfredo Donno, Alessio Monti
We describe an algorithm to compute the Wiener index of a sequence of finite graphs approximating the Sierpinski carpet.
Isomorphism classification of infinite Sierpinski carpet graphs
Daniele D'Angeli, Alfredo Donno
For each infinite word over a given finite alphabet, we define an increasing sequence of rooted finite graphs, that can be thought as approximations of the famous Sierpinski carpet…
Shuffling matrices, Kronecker product and Discrete Fourier Transform
Daniele D'Angeli, Alfredo Donno
We define and investigate a family of permutations matrices, called shuffling matrices, acting on a set of elements, where and for any $i=1,…
Wreath product of matrices
Daniele D'Angeli, Alfredo Donno
We introduce a new matrix product, that we call the wreath product of matrices. The name is inspired by the analogous product for graphs, and the following important correspondence…
Metric compactification of infinite Sierpiński carpet graphs
Daniele D'Angeli, Alfredo Donno
We associate, with every infinite word over a finite alphabet, an increasing sequence of rooted finite graphs, which provide a discrete approximation of the famous Sierpiński carpe…
Connectedness and isomorphism properties of the zig-zag product of graphs
Daniele D'Angeli, Alfredo Donno, Ecaterina Sava-Huss
In this paper we investigate the connectedness and the isomorphism problems for zig-zag products of two graphs. A sufficient condition for the zig-zag product of two graphs to be c…
Generalized wreath products of graphs and groups
Alfredo Donno
Inspired by the definition of generalized wreath product of permutation groups, we define the generalized wreath product of graphs, containing the classical Cartesian and wreath pr…
The lumpability property for a family of Markov chains on poset block structures
Daniele D'Angeli, Alfredo Donno
We construct different classes of lumpings for a family of Markov chain products which reflect the structure of a given finite poset. We use essentially combinatorial methods. We p…
Counting dimer coverings on self-similar Schreier graphs
Daniele D'Angeli, Alfredo Donno, Tatiana Nagnibeda
We study partition functions for the dimer model on families of finite graphs converging to infinite self-similar graphs and forming approximation sequences to certain well-known f…
On a family of Schreier graphs of intermediate growth associated with a self-similar group
Ievgen Bondarenko, Tullio Ceccherini-Silberstein, Alfredo Donno +1
For every infinite sequence , with , we construct an infinite 4-regular graph . These graphs are precisely the Schreier graphs of the action of a…
The Tutte Polynomial of the Schreier graphs of the Grigorchuk group and the Basilica group
Tullio Ceccherini-Silberstein, Alfredo Donno, Donatella Iacono
We study the Tutte polynomial of two infinite families of finite graphs. These are the Schreier graphs associated with the action of two well-known self-similar groups acting on th…
Weighted spanning trees on some self-similar graphs
Daniele D'Angeli, Alfredo Donno
We compute the complexity of two infinite families of finite graphs: the Sierpiński graphs, which are finite approximations of the well-known Sierpińsky gasket, and the Schreier gr…