Related papers: Sofic groups: graph products and graphs of groups

A graph is said to be orthogonalisable if the set of real symmetric matrices whose off-diagonal pattern is prescribed by its edges contains an orthogonal matrix. We determine some necessary and some sufficient conditions on the sizes of the…

A connected graph is called \emph{geodetic} if there is a unique geodesic between each pair of vertices. In this paper we prove that if a finitely generated group admits a Cayley graph which is geodetic, then the group must be virtually…

This article investigates the properties of order-divisor graphs associated with finite groups. An order-divisor graph of a finite group is an undirected graph in which the set of vertices includes all elements of the group, and two…

The power graph $P(G)$ of a finite group $G$ is the graph with vertex set $G$ and two distinct vertices are adjacent if either of them is a power of the other. Here we show that the power graph $P(G_1 \times G_2)$ of the direct product of…

A graph G is said to be orderenergetic, if its energy equal to its order and it is said to be hypoenergetic if its energy less than its order. Two non-isomorphic graphs of same order are said to be equienergetic if their energies are equal.…

In this paper, we first characterize which generalized lexicographic products are divisor graphs. As applications, we show that power graphs, reduced power graphs and order graphs are all divisor graphs, which also implies the main result…

We give upper bounds on the order of the automorphism group of a simple graph

Given an adaptable separated graph, we construct an associated groupoid and explore its type semigroup. Specifically, we first attach to each adaptable separated graph a corresponding semigroup, which we prove is an $E^*$-unitary inverse…

In this article we prove some previously announced results about metric ultraproducts of finite simple groups. We show that any non-discrete metric ultraproduct of alternating or special linear groups is a geodesic metric space. For more…

By means of analyzing the notion of verbal products of groups, we show that soficity, hyperlinearity, amenability, the Haagerup property, the Kazhdan's property (T) and exactness are preserved under taking $k$-nilpotent products of groups,…

A graph $\Gamma$ is said to be stable if $\mathrm{Aut}(\Gamma\times K_2)\cong\mathrm{Aut}(\Gamma)\times \mathbb{Z}_{2}$ and unstable otherwise. If an unstable graph is connected, non-bipartite and any two of its distinct vertices have…

We classify trivalent vertex-transitive graphs whose edge sets have a partition into a 2-factor composed of two cycles and a 1-factor that is invariant under the action of the automorphism group.

In this paper, we show that Cremona groups are sofic. We actually introduce a quantitative notion of soficity, called sofic profile, and show that the group of birational transformations of a d-dimensional variety has sofic profile at most…

We define and study analogs of curve graphs for infinite type surfaces. Our definitions use the geometry of a fixed surface and vertices of our graphs are infinite multicurves which are bounded in both a geometric and a topological sense.…

We prove that two Artin groups of spherical type are isomorphic if and only if their defining Coxeter graphs are the same.

There are several graphs defined on groups. Among them we consider graphs whose vertex set consists conjugacy classes of a group $G$ and adjacency is defined by properties of the elements of conjugacy classes. In particular, we consider…

We define a metric ultraproduct of topological groups with left-invariant metric, and show that there is a countable sequence of finite groups with left-invariant metric whose metric ultraproduct contains isometrically as a subgroup every…

Inspired by the definition of generalized wreath product of permutation groups, we define the generalized wreath product of graphs, containing the classical Cartesian and wreath product of graphs as particular cases. We prove that the…

We introduce and study, for a process P delivering edges on the Cartesian product of the vertex sets of a given set of graphs, the P-product of these graphs, thereby generalizing many types of product graph. Analogous to the notion of a…

We investigate prime character degree graphs of solvable groups. In particular, we consider a family of graphs $\Gamma_{k,t}$ constructed by adjoining edges between two complete graphs in a one-to-one fashion. In this paper we determine…