English
Related papers

Related papers: Splitting groups with cubic Cayley graphs of conne…

200 papers

The commuting graph of a group $G$ is the graph whose vertices are the elements of $G$, two distinct vertices joined if they commute. Our purpose in this paper is twofold: we discuss the computational problem of deciding whether a given…

Group Theory · Mathematics 2025-07-29 V. Arvind , Xuanlong Ma , Peter J. Cameron , Natalia V. Maslova

Let $G$ be a group. We define the coprime graph of subgroups of $G$, denoted by $\mathcal P(G)$, is a graph whose vertex set is the set of all proper subgroups of $G$, and two distinct vertices are adjacent if and only if the order of the…

Group Theory · Mathematics 2015-12-08 R. Rajkumar , P. Devi

We construct an infinite family of connected, 2-generated Cayley digraphs Cay(G;a,b) that do not have hamiltonian paths, such that the orders of the generators a and b are arbitrarily large. We also prove that if G is any finite group with…

Combinatorics · Mathematics 2013-06-25 Dave Witte Morris

Current methods of graph signal processing rely heavily on the specific structure of the underlying network: the shift operator and the graph Fourier transform are both derived directly from a specific graph. In many cases, the network is…

Signal Processing · Electrical Eng. & Systems 2023-03-31 Kathryn Beck , Mahya Ghandehari , Jeannette Janssen , Nauzer Kalyaniwalla

A well known theorem of Burns and Romanovskii states that a free product of subgroup separable groups is itself subgroup separable. We provide a proof using the language of immersions and coverings of graphs of groups, due to Bass.

Group Theory · Mathematics 2021-07-07 Naomi Andrew

A finite group is called $\psi$-divisible iff $\psi(H)|\psi(G)$ for any subgroup $H$ of a finite group $G$. Here, $\psi(G)$ is the sum of element orders of $G$. For now, the only known examples of such groups are the cyclic ones of…

Group Theory · Mathematics 2022-03-02 Mihai-Silviu Lazorec

Inspired by connections described in a recent paper by Mark L. Lewis, between the common divisor graph $\Ga(X)$ and the prime vertex graph $\Delta(X)$, for a set $X$ of positive integers, we define the bipartite divisor graph $B(X)$, and…

Combinatorics · Mathematics 2009-10-29 Mohammad A. Iranmanesh , Cheryl E. Praeger

We explore the combination theorem for a group G splitting as a graph of relatively hyperbolic groups. Using the fine graph approach to relative hyperbolicity, we find short proofs of the relative hyperbolicity of G under certain…

Group Theory · Mathematics 2012-11-14 Hadi Bigdely , Daniel T. Wise

A digraph is called an $n$-Cayley digraph if its automorphism group has an $n$-orbit semiregular subgroup. We determine the splitting fields of $n$-Cayley digraphs over abelian groups and compute a bound on their algebraic degrees, before…

Combinatorics · Mathematics 2024-01-17 Hao Li , Xiaogang Liu

Let $G$ be a finite group, $S\subseteq G\setminus\{1\}$ be a set such that if $a\in S$, then $a^{-1}\in S$, where $1$ denotes the identity element of $G$. The undirected Cayley graph $Cay(G,S)$ of $G$ over the set $S$ is the graph whose…

Combinatorics · Mathematics 2014-02-12 Alireza Abdollahi , Mojtaba Jazaeri

Let $G$ denote a finite abelian group with identity 1 and let $S$ denote an inverse-closed subset of $G \setminus {1}$, which generates $G$ and for which there exists $s \in S$, such that $\la S \setminus \{s,s^{-1}\} \ra \ne G$. In this…

Combinatorics · Mathematics 2012-06-01 Stefko Miklavic , Primoz Sparl

Let $G$ be a finite group, and $S$ be a subset of $G\setminus\{1\}$ such that $S=S^{-1}$. Suppose that $Cay(G,S)$ is the Cayley graph on $G$ with respect to the set $S$ which is the graph whose vertex set is $G$ and two vertices $a,b\in G$…

Combinatorics · Mathematics 2015-05-05 Alireza Abdollahi , Shahrooz Janbaz , Mojtaba Jazaeri

A graph $G$ is perfectly divisible if, for every induced subgraph $H$ of $G$, either $V(H)$ is a stable set or admits a partition into two sets $X_1$ and $X_2$ such that $\omega(H[X_1]) < \omega(H)$ and $H[X_2]$ is a perfect graph. In this…

Combinatorics · Mathematics 2025-04-30 David Scholz

For a finite group $G$, we define the inclusion graph of subgroups of $G$, denoted by $\mathcal I(G)$, is a graph having all the proper subgroups of $G$ as its vertices and two distinct vertices $H$ and $K$ in $\mathcal I(G)$ are adjacent…

Group Theory · Mathematics 2016-04-29 P. Devi , R. Rajkumar

A Cayley graph over a group $G$ is said to be central if its connection set is a normal subset of $G$. We prove that every central Cayley graph over a simple group $G$ has at most two pairwise nonequivalent Cayley representations over $G$…

Group Theory · Mathematics 2024-06-07 Jin Guo , Wenbin Guo , Grigory Ryabov , Andrey V. Vasil'ev

Let G be a finitely generated infinite pro-p group acting on a pro-p tree such that the restriction of the action to some open subgroup is free. Then we prove that G splits as a pro-p amalgamated product or as a pro-p HNN-extension over an…

Group Theory · Mathematics 2013-06-18 Wolfgang Herfort , Pavel Zalesskii , Theo Zapata

Let $W$ be a right-angled Coxeter group corresponding to a finite non-discrete graph $\mathcal{G}$ with at least $3$ vertices. Our main theorem says that $\mathcal{G}^c$ is connected if and only if for any infinite index quasiconvex…

Geometric Topology · Mathematics 2020-09-23 Michal Buran

A number of authors have studied the question of when a graph can be represented as a Cayley graph on more than one nonisomorphic group. In this paper we give conditions for when a Cayley graph on an abelian group can be represented as a…

Combinatorics · Mathematics 2022-05-04 Joy Morris , Adrian Skelton

We give necessary and sufficient conditions on the graph of a right-angled Artin group that determine whether the group is subgroup separable or not. Moreover, we investigate the profinite topology of the direct product of two free groups.…

Group Theory · Mathematics 2009-05-11 V. Metaftsis , E. Raptis

A graph is perfectly divisible if for each of its induced subgraph $H$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $\omega(H[B]) < \omega(H)$, and a graph $G$ is perfectly weight divisible if for every…

Combinatorics · Mathematics 2026-03-06 Qiming Hu , Baogang Xu , Miaoxia Zhuang