Related papers: The generating graph of the abelian groups

The prime graph $\Gamma(G)$ of a finite group $G$ (also known as the Gruenberg-Kegel graph) has as its vertices the prime divisors of $|G|$, and $p\text-q$ is an edge in $\Gamma(G)$ if and only if $G$ has an element of order $pq$. Since…

A gain graph is a triple (G,h,H), where G is a connected graph with an arbitrary, but fixed, orientation of edges, H is a group, and h is a homomorphism from the free group on the edges of G to H. A gain graph is called balanced if the…

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…

Every countable group $G$ can be embedded in a finitely generated group $G^*$ that is hopfian and complete, i.e. $G^*$ has trivial centre and every epimorphism $G^*\to G^*$ is an inner automorphism. Every finite subgroup of $G^*$ is…

A generating pair $x, y$ for a group $G$ is said to be \textbf{\textit{symmetric}} if there exists an automorphism $\varphi_{x,y}$ of $G$ inverting both $x$ and $y$, that is, $x^{\varphi_{x,y}}=x^{-1}$ and $y^{\varphi_{x,y}}=y^{-1}$.…

Let $H$ be a subgroup of a finite non-abelian group $G$ and $g \in G$. Let $Z(H, G) = \{x \in H : xy = yx, \forall y \in G\}$. We introduce the graph $\Delta_{H, G}^g$ whose vertex set is $G \setminus Z(H, G)$ and two distinct vertices $x$…

We construct, for the first time, various types of specific non-special finite $p$-groups having abelian automorphism group. More specifically, we construct groups $G$ with abelian automorphism group such that $\gamma_2(G) < \mathrm{Z}(G) <…

This paper deals with the vertex connectivity of enhanced power graph of finite group. We classify all abelian groups G such that vertex connectivity of enhanced power graph of G is 1. We derive an upper bound of vertex connectivity for 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…

A biased graph consists of a graph $G$ together with a collection of distinguished cycles of $G$, called balanced cycles, with the property that no theta subgraph contains exactly two balanced cycles. Perhaps the most natural biased graphs…

A square complex is a 2-complex formed by gluing squares together. This article is concerned with the fundamental group $\Gamma$ of certain square complexes of nonpositive curvature, related to quaternion algebras. The abelian subgroup…

In this paper, we investigate certain graphs defined on groups, with a focus on infinite groups. The graphs discussed are the power graph, the enhanced power graph, and the commuting graph whose vertex set is a group $G$. The power graph is…

Let $\mathcal{G}$ be a properly face 2-coloured (say black and white) \break piecewise-linear triangulation of the sphere with vertex set $V$. Consider the abelian group $\mathcal{A}_W$ generated by the set $V$, with relations $r+c+s=0$ for…

Let $G$ be a finite group, $n$ a positive integer. $\pi(n)$ denotes the set of all prime divisors of $n$ and $\pi(G)=\pi(|G|)$. The prime graph $\Gamma(G)$ of $G$, defined by Grenberg and Kegel, is a graph whose vertex set is $\pi(G)$, two…

A graph \Gamma is said to be {\em symmetric} if its automorphism group \Aut(\Gamma) is transitive on the arc set of \Gamma. Let $G$ be a finite non-abelian simple group and let \Gamma be a connected pentavalent symmetric graph such that…

Let $R$ be a ring with unity. The cozero-divisor graph of a ring $R$, denoted by $\Gamma'(R)$, is an undirected simple graph whose vertices are the set of all non-zero and non-unit elements of $R$, and two distinct vertices $x$ and $y$ are…

Let $G$ be a finite insoluble group with soluble radical $ R(G)$. The solubility graph $\Gamma_{\rm S}(G)$ of $G$ is a simple graph whose vertices are the elements of $G\setminus R(G) $ and two distinct vertices $x$ and $y$ are adjacent if…

The power graph of a group is the simple graph with vertices as the group elements, in which two distinct vertices are adjacent if and only if one of them can be obtained as an integral power of the other. We study (minimal) cut-sets of the…

Let $G$ be a finite group. The solubility graph associated with the finite group $G$, denoted by $\Gamma_{\cal S}(G)$, is a simple graph whose vertices are the non-trivial elements of $G$, and there is an edge between two distinct elements…

Let $\Gamma$ be a torsion free lattice in $G=\PGL(3,{{\mathbb F}})$ where ${{\mathbb F}}$ is a nonarchimedean local field. Then $\Gamma$ acts freely on the affine Bruhat-Tits building ${\mathcal B}$ of $G$ and there is an induced action on…