Searcharxiv⌕ Search

arXiv subjects

Alfredo Donno

Publications and source records attributed to Alfredo Donno.

At least 19 recordsLinked to original sources

Switching reconstruction of signed graphs: net-degree and balance

The switching reconstruction problem for $2$-edge-colored graphs, introduced by Bondy and Mercier, asks whether such a graph is determined up to isomorphism by the multiset of the graphs obtained by exchanging the colors of the edges at each vertex; for complete underlying graphs it is the vertex-switching reconstruction problem of Stanley. We study this problem in the language of signed graphs, where the net-degree of a vertex and the notion of balance come naturally into play. We prove that a signed graph on $n\neq4$ vertices is reconstructible when its net-degrees are all positive, all negative or all zero, which generalizes the reconstructibility of regular graphs in Stanley's problem. For connected balanced signed graphs, whose switching reconstruction problem we show to be equivalent to that of connected graphs with a distinguished bipartition of the vertex set, we prove reconstructibility when the two parts of the bipartition differ in size by more than two, and when all net-degrees are non-negative.

math.CO↗

Degree similar and net-degree similar signed graphs

Two graphs are degree similar if their adjacency matrices and their degree matrices are simultaneously similar, a notion recently introduced by Godsil and Sun. We extend it to signed graphs in two ways, degree similarity and net-degree similarity, according to whether the degree or the net-degree matrix is used. We prove that signed trees are determined by their degree similarity class, but not by their net-degree similarity class. We then develop constructions of (net-)degree similar signed graphs, based on a signed version of Godsil--McKay switching, on partial transposition and on block extensions. As a byproduct, we obtain infinite families both of pairs of net-degree similar unicyclic signed graphs with non-isomorphic underlying graphs, and of unicyclic signed graphs, not necessarily regular, which are not determined by their degree similarity class. This settles the net-degree version of a problem of Godsil and Sun on unicyclic graphs.

math.CO↗

Godsil-McKay switchings for gain graphs

We introduce a switching operation, inspired by the Godsil-McKay switching, in order to obtain pairs of $G$-cospectral gain graphs, that are gain graphs cospectral with respect to every representation of the gain group $G$. For instance, for two signed graphs, this notion of cospectrality is equivalent to the cospectrality of their signed adjacency matrices together with the cospectrality of their underlying graphs. Moreover, we introduce another more flexible switching in order to obtain pairs of gain graphs cospectral with respect to some fixed unitary representation. Many existing notions of spectrum for graphs and gain graphs are indeed special cases of these spectra associated with particular representations, therefore our construction recovers the classical Godsil-McKay switching and the Godsil-McKay switching for signed and complex unit gain graphs. As in the classical case, not all gain graphs are suitable for these switchings: we analyze the relationships between the properties that make the graph suitable for the one or the other switching. Finally we apply our construction in order to define a Godsil-McKay switching for the right spectrum of quaternion unit gain graphs.

math.CO↗

On a class of poly-context-free groups generated by automata

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 partially commutative monoid associated with the complement of the line graph of the defining tree. After that, we generalize these groups by introducing the quite broad class of reducible automaton groups, which lies in the class of contracting automaton groups without singular points. We give a general structure theorem that shows that all reducible automaton groups are direct limit of poly-context-free groups which are virtually subgroups of the direct product of free groups; notice that this result partially supports a conjecture by T. Brough. Moreover, we prove that tree automaton groups with at least two generators are not finitely presented and they are amenable groups, which are direct limit of non-amenable groups.

math.GR↗

On cospectrality of gain graphs

We define $G$-cospectrality of two $G$-gain graphs $(Γ,ψ)$ and $(Γ',ψ')$, proving that it is a switching isomorphism invariant. When $G$ is a finite group, we prove that $G$-cospectrality is equivalent to cospectrality with respect to all unitary representations of $G$. Moreover, we show that two connected gain graphs are switching equivalent if and only if the gains of their closed walks centered at an arbitrary vertex $v$ can be simultaneously conjugated. In particular, the number of switching equivalence classes on an underlying graph $Γ$ with $n$ vertices and $m$ edges, is equal to the number of simultaneous conjugacy classes of the group $G^{m-n+1}$. We provide examples of $G$-cospectral non-switching isomorphic graphs and we prove that any gain graph on a cycle is determined by its $G$-spectrum. Moreover, we show that when $G$ is a finite cyclic group, the cospectrality with respect to a faithful irreducible representation implies the cospectrality with respect to any other faithful irreducible representation, and that the same assertion is false in general.

math.CO↗

Characterizations of line graphs in signed and gain graphs

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 and the Beineke's characterization. In particular, we present a list of forbidden gain subgraphs characterizing the class of gain-line graphs. In the case of a signed graph whose underlying graph is a line graph, this list consists of exactly four signed graphs. Under the same hypothesis, we prove that a signed graph is the line graph of a signed graph if and only if its eigenvalues are either greater than $-2$, or less than $2$, depending on which particular definition of line graph is adopted.

math.CO↗

On an uncountable family of graphs whose spectrum is a Cantor set

For each $p\geq 1$, the star automaton group $\mathcal{G}_{S_p}$ is an automaton group which can be defined starting from a star graph on $p+1$ vertices. We study Schreier graphs associated with the action of the group $\mathcal{G}_{S_p}$ on the regular rooted tree $T_{p+1}$ of degree $p+1$ and on its boundary $\partial T_{p+1}$. With the transitive action on the $n$-th level of $T_{p+1}$ is associated a finite Schreier graph $Γ^p_n$, whereas there exist uncountably many orbits of the action on the boundary, represented by infinite Schreier graphs which are obtained as limits of the sequence $\{Γ_n^p\}_{n\geq 1}$ in the Gromov-Hausdorff topology. We obtain an explicit description of the spectrum of the graphs $\{Γ_n^p\}_{n\geq 1}$. Then, by using amenability of $\mathcal{G}_{S_p}$, we prove that the spectrum of each infinite Schreier graph is the union of a Cantor set of zero Lebesgue measure, which is the Julia set of the quadratic map $f_p(z) = z^2-2(p-1)z -2p$, and a countable collection of isolated points supporting the KNS spectral measure. We also give a complete classification of the infinite Schreier graphs up to isomorphism of unrooted graphs, showing that they may have $1$, $2$ or $2p$ ends, and that the case of $1$ end is generic with respect to the uniform measure on $\partial T_{p+1}$.

math.GR↗

Gain-line graphs via $G$-phases and group representations

Let $G$ be an arbitrary group. We define a gain-line graph for a gain graph $(Γ,ψ)$ through the choice of an incidence $G$-phase matrix inducing $ψ$. We prove that the switching equivalence class of the gain function on the line graph $L(Γ)$ does not change if one chooses a different $G$-phase inducing $ψ$ or a different representative of the switching equivalence class of $ψ$. In this way, we generalize to any group some results proven by N. Reff in the abelian case. The investigation of the orbits of some natural actions of $G$ on the set $\mathcal H_Γ$ of $G$-phases of $Γ$ allows us to characterize gain functions on $Γ$, gain functions on $L(Γ)$, their switching equivalence classes and their balance property. The use of group algebra valued matrices plays a fundamental role and, together with the matrix Fourier transform, allows us to represent a gain graph with Hermitian matrices and to perform spectral computations. Our spectral results also provide some necessary conditions for a gain graph to be a gain-line graph.

math.CO↗

Graph automaton groups

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 is amenable of exponential growth. We also highlight a connection between our construction and the right-angled Artin groups. We then study the Schreier graphs associated with the self-similar action of these automaton groups on the regular rooted tree. We explicitly determine their diameter and their automorphism group in the case where the initial graph is a path. Moreover, we show that the case of cycles gives rise to Schreier graphs whose automorphism group is isomorphic to the dihedral group. It is remarkable that our construction recovers some classical examples of automaton groups like the Adding machine and the Tangled odometer.

math.GR↗

A group representation approach to balance of gain graphs

We study the balance of $G$-gain graphs, where $G$ is an arbitrary group, by investigating their adjacency matrices and their spectra. As a first step, we characterize switching equivalence and balance of gain graphs in terms of their adjacency matrices in $M_n(\mathbb C G)$. Then we introduce a represented adjacency matrix, associated with a gain graph and a group representation, by extending the theory of Fourier transforms from the group algebra $\mathbb C G$ to the algebra $M_n(\mathbb C G)$. We prove that a gain graph is balanced if and only if the spectrum of the represented adjacency matrix associated with any (or equivalently all) faithful unitary representation of $G$ coincides with the spectrum of the underlying graph, with multiplicity given by the degree of the representation. We show that the complex adjacency matrix of unit gain graphs and the adjacency matrix of a cover graph are indeed particular cases of our construction. This enables us to recover some classical results and prove some new characterizations of balance in terms of spectrum, index or structure of these graphs.

math.CO↗

Constructing cospectral signed graphs

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 B. McKay (in 1982) shed some light on the explanation of the presence of isospectral graphs, and they gave routines to construct PINGS. Here, we consider the Godsil-McKay--type routines developed for graphs, whose adjacency matrices are $(0,1)$-matrices, to the level of signed graphs, whose adjacency matrices allow the presence of $-1$'s. We show that, with suitable adaption, such routines can be successfully ported to signed graphs, and we can build pairs of cospectral switching nonisomorphic signed graphs.

math.CO↗

Distance-balanced graphs and Travelling Salesman Problems

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. In analogy with the classical case, where the distance-balancedness of a graph is equivalent to the property of being self-median, we characterize the class of $p$TS-distance-balanced graphs in terms of their equity with respect to certain probabilistic centrality measures, inspired by the Travelling Salesman Problem. We prove that it is possible to detect this property looking at the classical distance-balancedness (and therefore looking at the classical centrality problems) of a suitable graph composition, namely the wreath product of graphs. More precisely, we characterize the distance-balancedness of a wreath product of two graphs in terms of the $p$TS-distance-balancedness of the factors.

math.CO↗

Permutational powers of a graph

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 matrix of the graph. It is shown that this construction recovers the classical zig-zag product of graphs when the permutation is an involution, and it is in fact more general. We start by discussing necessary and sufficient conditions on the permutation and on the adjacency matrix of a graph to guarantee their composition to represent an adjacency matrix of a graph, then we focus our attention on the cases in which the permutational power does not reduce to a zig-zag product. We show that the cases of interest are those in which the adjacency matrix is singular. This leads us to frame our problem in the context of equitable partitions, obtained by identifying vertices having the same neighborhood. The families of cyclic and complete bipartite graphs are treated in details.

math.CO↗

Some degree and distance-based invariants of wreath products of graphs

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. This paper is devoted to the description of some degree and distance-based invariants, of large interest in Chemical Graph Theory, for a wreath product of graphs. An explicit formula is obtained for the Zagreb indices, in terms of the Zagreb indices of the factor graphs. A detailed analysis of distances in a wreath product is performed, allowing to describe the antipodal graph and to provide a formula for the Wiener index. Finally, a formula for the Szeged index is obtained. Several explicit examples are given.

math.CO↗

Isomorphism classification of infinite Sierpinski carpet graphs

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. These sequences naturally converge to an infinite rooted limit graph. We show that there are uncountably many classes of isomorphism of such limit graphs, regarded as unrooted graphs.

math.CO↗

Shuffling matrices, Kronecker product and Discrete Fourier Transform

We define and investigate a family of permutations matrices, called shuffling matrices, acting on a set of $N=n_1\cdots n_m$ elements, where $m\geq 2$ and $n_i\geq 2$ for any $i=1,\ldots, m$. These elements are identified with the vertices of the $m$-th level of a rooted tree with branch indices $(n_1,\ldots, n_m)$. Each of such matrices is induced by a permutation of $Sym(m)$ and it turns out that, in the case in which one considers the cyclic permutation $(1\ \ldots\ m)$, the corresponding permutation is the classical perfect shuffle. We give a combinatorial interpretation of these permutations in terms of lexicographic order of the vertices of the tree. This allows us to describe their fixed points. We show that our permutation matrices can be used to let the Kronecker product of matrices commute or, more generally, rearrange in an arbitrary order. Moreover, we show that the group generated by such permutations does depend only on the branch indices of the tree, but it is independent from their order. In the case in which such indices coincide, we prove that the corresponding group is a copy of $Sym(m)$ inside $Sym(n^m)$. Finally, we give an application of shuffling matrices in the context of the Discrete Fourier Transform.

math.CO↗

Metric compactification of infinite Sierpiński carpet graphs

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 carpet fractal. Each of these sequences converges, in the Gromov-Hausdorff topology, to an infinite rooted graph. We give an explicit description of the metric compactification of each of these limit graphs. In particular, we are able to classify Busemann and non-Busemann points of the metric boundary. It turns out that, with respect to the uniform Bernoulli measure on the set of words indexing the graphs, for almost all the infinite graphs, the boundary consists of four Busemann points and countably many non-Busemann points.

math.MG↗