Related papers: On the question "Can one hear the shape of a group…

If $G$ is a finite group, then the spectrum $\omega(G)$ is the set of all element orders of $G$. The prime spectrum $\pi(G)$ is the set of all primes belonging to $\omega(G)$. A simple graph $\Gamma(G)$ whose vertex set is $\pi(G)$ and in…

Let $G$ be 2-generated group. The generating graph $\Gamma(G)$ of $G$ is the graph whose vertices are the elements of $G$ and where two vertices $g$ and $h$ are adjacent if $G = \langle g, h \rangle.$ This definition can be extended to a…

The genus spectrum of a finite group $G$ is the set of all $g\geq 2$ such that $G$ acts faithfully and orientation-preserving on a closed compact orientable surface of genus $g$. This article is an overview of some results relating the…

Let $G$ be a right-angled Artin group with defining graph $\Gamma$ and let $H$ be a finitely generated group quasi-isometric to $G(\Gamma)$. We show if $G$ satisfies (1) its outer automorphism group is finite; (2) $\Gamma$ does not have…

This paper develops a harmonic Galois theory for finite graphs, thereby classifying harmonic branched $G$-covers of a fixed base $X$ in terms of homomorphisms from a suitable fundamental group of $X$ together with $G$-inertia structures on…

Given a finite group $G$, the generating graph $\Gamma(G)$ of $G$ has as vertices the non-identity elements of $G$ and two vertices are adjacent if and only if they are distinct and generate $G$ as group elements. Let $G$ be a 2-generated…

In this note, we study non-transitive graphs and prove a number of results when they satisfy a coarse version of transitivity. Also, for each finitely generated group $G$, we produce continuum many pairwise non-quasi-isometric regular…

The spectrum $\omega(G)$ of a finite group $G$ is the set of element orders of $G$. Finite groups $G$ and $H$ are isospectral if their spectra coincide. Suppose that $L$ is a simple classical group of sufficiently large dimension (the lower…

In this paper, we prove a series of results on group embeddings in groups with a small number of generators. We show that each finitely generated group $G$ lying in a variety ${\mathcal M}$ can be embedded in a $4$-generated group $H \in…

An integral homology theory on the category of undirected reflexive graphs was constructed in [2]. A geometrical method to understand behaviors of $1$- and $2$-simplices under differential maps of the theory was developed in [3] and led us…

A {\it graph product} $G$ on a graph $\Gamma$ is a group defined as follows: For each vertex $v$ of $\Gamma$ there is a corresponding non-trivial group $G_v$. The group $G$ is the quotient of the free product of the $G_v$ by the commutation…

Assume that $G$ is a finite group. For every $a, b \in\mathbb N,$ we define a graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and $(y_1,\dots,y_b)$ are adjacent if…

Given a finite group $G$, the generating graph $\Gamma(G)$ of $G$ has as vertices the (nontrivial) elements of $G$ and two vertices are adjacent if and only if they are distinct and generate $G$ as group elements. In this paper we…

The $G$-graph $\Gamma(G,S)$ is a graph from the group $G$ generated by $S\subseteq G$, where the vertices are the right cosets of the cyclic subgroups $\langle s \rangle, s\in S$ with $k$-edges between two distinct cosets if there is an…

The prime graph of a finite group $G$ is the labelled graph $\Gamma(G)$ with vertices the prime divisors of $|G|$ and edges the pairs $\{p,q\}$ for which $G$ contains an element of order $pq$. A group $G$ is recognisable by its prime graph…

The Gruenberg-Kegel graph $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an element of order $rs$…

Given a 2-generated finite group $G$, the non-generating graph of $G$ has as vertices the elements of $G$ and two vertices are adjacent if and only if they are distinct and do not generate $G$. We consider the graph $\Sigma(G)$ obtained…

We consider the oriented graph whose vertices are isomorphism classes of finitely generated groups, with an edge from G to H if, for some generating set T in H and some sequence of generating sets S_i in G, the marked balls of radius i in…

A group $G$ is said to be $\frac{3}{2}$-generated if every nontrivial element belongs to a generating pair. It is easy to see that if $G$ has this property then every proper quotient of $G$ is cyclic. In this paper we prove that the…

From a graph $G$ with constant valency $v$ and a (non-compact) manifold $C$ with $v$ boundary components, we build a $G$-periodic manifold $M$. This process gives a class of topologically infinite manifolds which generalizes periodic…