activity
20092022
most citedCounting dimer coverings on self-similar Schreier graphs

23 citations · 187 across the 26 of their papers we have counts for

collaborators

29 papers

math.CO2022★ 2 cited

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…

math.GR2022★ 1 cited

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…

math.CO2021★ 10 cited

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…

math.GR2021

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…

math.CO2021★ 6 cited

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…

math.CO2020★ 10 cited

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…