Related papers: On the congruence subgroup problem for branch grou…

Recent evidence indicates that the abundance of recurring elementary interaction patterns in complex networks, often called subgraphs or motifs, carry significant information about their function and overall organization. Yet, the…

Sandpile groups are a subtle graph isomorphism invariant, in the form of a finite abelian group, whose cardinality is the number of spanning trees in the graph. We study their group structure for graphs obtained by attaching a cone vertex…

Understanding the structure of a graph along with the structure of its subgraphs is important for several problems in graph theory. Two examples are the Reconstruction Conjecture and isomorph-free generation. This paper raises the question…

Knopfmacher et all [1] was introduced the graph compositions` notion. In this note we add to these a new construction of tree-like graphs where nodes are graphs themselves. The first examples of these tree-like compositions, a corresponding…

For a finitely generated free group F_n, of rank at least 2, any finite subgroup of Out(F_n) can be realized as a group of automorphisms of a graph with fundamental group F_n. This result, known as Out(F_n) realization, was proved by…

We give a general construction of topological groups from combinatorial structures such as trees, towers, gaps, and subadditive functions. We connect topological properties of corresponding groups with combinatorial properties of these…

We present a mathematical framework for describing the topology of configuration spaces for particles on one-connected graphs. In particular, we compute the homology groups over integers for different classes of one-connected graphs. Our…

Group consensus implies reaching multiple groups where agents belonging to the same cluster reach state consensus. This paper focuses on linear multi-agent systems under nonnegative directed graphs. A new necessary and sufficient condition…

The number of subgroups and the number of cyclic subgroups are natural combinatorial invariants of a finite group. We investigate how restrictions on these quantities, together with the number of distinct prime divisors of $|G|$, enforce…

The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…

There has been a great deal of attention recently to graphs whose vertex set is a group, defined using the group structure. (The commuting graph, where two elements are joined if they commute, is the oldest and most famous example.) The…

I define a "group graph" which encodes the symmetry in a dynamical process on a network. Group graphs extend signed networks, where links are labelled with plus or minus one, by allowing link labels from any group and generalising the…

We prove a topological stability result for the actions of hyperbolic groups on their Bowditch boundaries. More precisely, we show that a sufficiently small perturbation of the standard boundary action, if assumed on each parabolic subgroup…

Stanley introduced the concept of chromatic symmetric functions of graphs which extends and refines the notion of chromatic polynomials of graphs, and asked whether trees are determined up to isomorphism by their chromatic symmetric…

This paper introduces a group-theoretic framework to analyze the algebraic structure of the Grover walk on a complete graph with self-loops. We construct a group generated by the Grover matrix and a diagonal matrix whose entries are powers…

We propose a generalisation of the congruence subgroup problem for groups acting on rooted trees. Instead of only comparing the profinite completion to that given by level stabilizers, we also compare pro-$\mathcal{C}$ completions of the…

We find the automorphism group of the moduli space of parabolic bundles on a smooth curve (with fixed determinant and system of weights). This group is generated by: automorphisms of the marked curve, tensoring with a line bundle, taking…

The inducibility of a graph represents its maximum density as an induced subgraph over all possible sequences of graphs of size growing to infinity. This invariant of graphs has been extensively studied since its introduction in $1975$ by…

Grouping the nodes of a graph into clusters is a standard technique for studying networks. We study a problem where we are given a directed network and are asked to partition the graph into a sequence of coherent groups. We assume that…

We are concerned with orderable groups and particularly those with orderings invariant not only under multiplication, but also under a given automorphism or family of automorphisms. Several applications to topology are given: we prove that…