9 citations · 9 across the 2 of their papers we have counts for
8 papers
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…
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…
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.