English
Related papers

Related papers: Finite groups with regular subgroup graph

200 papers

Let $G$ be a profinite group. We prove that the commutator subgroup $G'$ is finite-by-procyclic if and only if the set of all commutators of $G$ is contained in a union of countably many procyclic subgroups.

Group Theory · Mathematics 2016-11-08 Cristina Acciarri , Pavel Shumyatsky

The cyclic subgroup graph ${\Gamma(G)}$ of a group $G$ is the simple undirected graph with cyclic subgroups as a vertex set and two distinct vertices $H_1$ and $H_2$ are adjacent if and only if $H_1 \leq H_2$ and there does not exist any…

Combinatorics · Mathematics 2025-03-18 Siddharth Malviy , Vipul Kakkar , Swapnil Srivastava

The \emph{difference subgroup graph} $D(G)$ of a finite group $G$ is defined as the graph whose vertices are the non-trivial proper subgroups of $G$, with two distinct vertices $H$ and $K$ adjacent if and only if $\langle H, K \rangle = G$…

Group Theory · Mathematics 2025-11-07 Angsuman Das , Arnab Mandal , Labani Sarkar

In this paper we study prime graphs of finite groups. The prime graph of a finite group $G$, also known as the Gruenberg-Kegel graph, is the graph with vertex set {primes dividing $|G|$} and an edge $p$-$q$ if and only if there exists an…

Group Theory · Mathematics 2022-01-04 Chris Florez , Jonathan Higgins , Kyle Huang , Thomas Michael Keller , Dawei Shen , Yong Yang

Using graph-theoretic techniques for f.g. subgroups of $F^{\mathbb{Z}[t]}$ we provide a criterion for a f.g. subgroup of a f.g. fully residually free group to be of finite index. Moreover, we show that this criterion can be checked…

Group Theory · Mathematics 2021-07-14 Andrey Nikolaev , Denis Serbin

We show that certain graphs of groups with cyclic edge groups are aTmenable. In particular, this holds when each vertex group is either virtually special or acts properly and semisimply on $\mathbb{H}^n$.

Group Theory · Mathematics 2017-01-03 Mathieu Carette , Daniel T. Wise , Daniel J. Woodhouse

Answering a question due to Min, we prove that a finite graph of roses admits a regluing such that the resulting graph of roses has hyperbolic fundamental group.

Group Theory · Mathematics 2022-10-19 Pritam Ghosh , Mahan Mj

The {\it prime 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 $G$ of order…

Group Theory · Mathematics 2019-11-15 Ilya Gorshkov , Alexey Staroletov

In this paper, we consider various graphs, namely: power graph, cyclic graph, enhanced power graph and commuting graph, on a finite semigroup $S$. For an arbitrary pair of these four graphs, we classify finite semigroups such that the…

Group Theory · Mathematics 2020-07-23 Sandeep Dalal , Jitender Kumar

We establish conditions under which the fundamental group of a graph of finite $p$-groups is necessarily residually $p$-finite. The technique of proof is independent of previously established results of this type, and the result is also…

Group Theory · Mathematics 2018-11-01 Gareth Wilkes

Marius T\u{a}rn\u{a}uceanu described the finite groups $G$ having $|G|-1$ cyclic subgroups. We describe the finite groups $G$ having $|G|-\Delta$ cyclic subgroups for $\Delta=2, 3, 4$ and $5$.

Group Theory · Mathematics 2018-06-19 Richard Belshoff , Joe Dillstrom , Les Reid

T.C. Burness and S.D. Scott \cite{3} classified finite groups $G$ such that the number of prime order subgroups of $G$ is greater than $|G|/2-1$. In this note, we study finite groups $G$ whose subgroup graph contains a vertex of degree…

Group Theory · Mathematics 2025-02-05 Marius Tărnăuceanu

In this article we introduce and study a class of finite groups for which the orders of normal subgroups satisfy a certain inequality. It is closely connected to some well-known arithmetic classes of natural numbers.

Group Theory · Mathematics 2018-05-31 Marius Tărnăuceanu

We establish a combination theorem for parafree groups. These groups were introduced by Baumslag in the sixties. One of the current motivations for a better understanding of their structure is that they show up naturally in connection with…

Group Theory · Mathematics 2024-03-04 Andrei Jaikin-Zapirain , Ismael Morales

We prove that, given a torsion-free relatively hyperbolic group G with non-relatively-hyperbolic peripherals, isomorphic finite index subgroups of G have the same index. This applies for instance to fundamental groups of finite-volume…

Group Theory · Mathematics 2025-09-05 Nir Lazarovich , Gon Rahamim , Alessandro Sisto

Let $G$ be a group. \textit{The permutability graph of cyclic subgroups of $G$}, denoted by $\Gamma_c(G)$, is a graph with all the proper cyclic subgroups of $G$ as its vertices and two distinct vertices in $\Gamma_c(G)$ are adjacent if and…

Group Theory · Mathematics 2015-04-06 R. Rajkumar , P. Devi

Let G be a finite group. A subgroup M of G is said to be an NR-subgroup if, whenever K is normal in M, then K^G\cap M=K, where K^G is the normal closure of K in G. Using the Classification of Finite Simple Groups, we prove that if every…

Group Theory · Mathematics 2009-12-07 Hung P. Tong-Viet

For a finite group $G$ with a normal subgroup $H$, the normal subgroup based power graph of $G$, denoted by $\Gamma_H(G)$ whose vertex set $V(\Gamma_H(G))=(G\setminus H)\bigcup \{e\}$ and two vertices $a$ and $b$ are edge connected if…

Combinatorics · Mathematics 2016-01-19 A. K. Bhuniya , Sudip Bera

A finite group $G$ is said to be rational if every character of $G$ is rational-valued. The Gruenberg-Kegel graph of a finite group $G$ is the undirected graph whose vertices are the primes dividing the order of $G$ and the edges join…

Group Theory · Mathematics 2024-04-02 Sara C. Debón , Diego García-Lucas , Ángel del Río

We prove that every finitely generated Kleinian group that contains a finite, non-cyclic subgroup either is finite or virtually free or contains a surface subgroup. Hence, every arithmetic Kleinian group contains a surface subgroup.

Geometric Topology · Mathematics 2009-07-28 Marc Lackenby