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