English
Related papers

Related papers: Groups for which it is easy to detect graphical re…

200 papers

A finite group $R$ is a DCI-group if, whenever $S$ and $T$ are subsets of $R$ with the Cayley graphs ${\rm Cay}(R,S)$ and ${\rm Cay}(R,T)$ isomorphic, there exists an automorphism $\varphi$ of $R$ with $S^\varphi=T$. Elementary abelian…

Group Theory · Mathematics 2014-03-19 Joy Morris

The directed power graph $\vec{\mathcal G}(\mathbf G)$ of a group $\mathbf G$ is the simple digraph with vertex set $G$ such that $x\rightarrow y$ if $y$ is a power of $x$. The power graph of $\mathbf G$, denoted with $\mathcal G(\mathbf…

Group Theory · Mathematics 2021-02-09 Samir Zahirović

The isomorphism problem for digraphs is a fundamental problem in graph theory. This problem for Cayley digraphs has been extensively investigated over the last half a century. In this paper, we consider this problem for $m$-Cayley digraphs…

Combinatorics · Mathematics 2024-09-04 Xing Zhang , Yuan-Quan Feng , Fu-Gang Yin , Jin-Xin Zhou

The directed power graph $\vec{\mathcal P}(\mathbf G)$ of a group $\mathbf G$ is the simple digraph with vertex set $G$ such that $x\rightarrow y$ if $y$ is a power of $x$. The power graph of $\mathbf G$, denoted by $\mathcal P(\mathbf G)$,…

Combinatorics · Mathematics 2023-01-10 Ivica Bošnjak , Rozália Madarász , Samir Zahirović

The directed power graph $\vec{\mathcal G}(\mathbf G)$ of a group $\mathbf G$ is the simple digraph with vertex set $G$ such that $x\rightarrow y$ if $y$ is a power of $x$. The power graph $\mathcal G(\mathbf G)$ of the group $\mathbf G$ is…

Group Theory · Mathematics 2022-10-18 Sayyed Heidar Jafari , Samir Zahirović

A Cayley digraph $\rm{Cay}(G,S)$ of a group $G$ with respect to a subset $S$ of $G$ is called a CI-digraph if for any Cayley digraph $\rm{Cay}(G,T)$ isomorphic to $\rm{Cay}(G,S)$, there is an $\alpha\in \rm{Aut}(G)$ such that $S^\alpha=T$.…

Combinatorics · Mathematics 2022-10-24 Jin-Hua Xie , Yan-Quan Feng , Young Soo Kwon

A group has the (D)CI ((Directed) Cayley Isomorphism) property, or more commonly is a (D)CI group, if any two Cayley (di)graphs on the group are isomorphic via a group automorphism. That is, $G$ is a (D)CI group if whenever…

Combinatorics · Mathematics 2023-11-22 Joy Morris

A finite group $G$ is called a DCI-group if two Cayley digraphs over $G$ are isomorphic if and only if their connection sets are conjugate by a group automorphism. We prove that the group $C_2^5\times C_p$, where $p$ is a prime, is a…

Combinatorics · Mathematics 2020-12-29 Grigory Ryabov

The Gruenberg-Kegel graph (or the 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…

Group Theory · Mathematics 2025-04-22 Mingzhu Chen , Natalia V. Maslova , Marianna R. Zinov'eva

A Cayley graph $\Cay(G,S)$ is said to be inner-automorphic if $S$ is a union of conjugacy classes of a group $G$, and arc-transitive if its full automorphism group acts transitively on the set of arcs. In this paper, we characterize four…

Group Theory · Mathematics 2026-04-07 Jun-Jie Huang , Jin-Hua Xie

In this paper, generalized Cayley graphs are studied. It is proved that every generalized Cayley graph of order 2p is a Cayley graph, where p is a prime. Special attention is given to generalized Cayley graphs on Abelian groups. It is…

Combinatorics · Mathematics 2015-12-02 Ademir Hujdurović , Klavdija Kutnar , Pawel Petecki , Anastasiya Tanana

A Cayley graph on a group $G$ has a natural edge-colouring. We say that such a graph is CCA if every automorphism of the graph that preserves this edge-colouring is an element of the normaliser of the regular representation of $G$. A group…

Combinatorics · Mathematics 2017-04-06 Luke Morgan , Joy Morris , Gabriel Verret

These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…

Group Theory · Mathematics 2021-03-29 Peter J. Cameron

Graph G is the square of graph H if two vertices x, y have an edge in G if and only if x, y are of distance at most two in H. Given H it is easy to compute its square H2, however Motwani and Sudan proved that it is NP-complete to determine…

Discrete Mathematics · Computer Science 2009-02-13 Babak Farzad , Lap Chi Lau , Van Bang Le , Nguyen Ngoc Tuy

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

A \emph{mixed dihedral group} is a group $H$ with two disjoint subgroups $X$ and $Y$, each elementary abelian of order $2^n$, such that $H$ is generated by $X\cup Y$, and $H/H'\cong X\times Y$. In this paper we give a sufficient condition…

Combinatorics · Mathematics 2023-04-24 Daniel R. Hawtin , Cheryl E. Praeger , Jin-Xin Zhou

We produce a sequence of finite dimensional representations of the fundamental group $\pi_1(S)$ of a closed surface where all simple closed curves act with finite order, but where each non--simple closed curve eventually acts with infinite…

Geometric Topology · Mathematics 2017-12-12 Thomas Koberda , Ramanujan Santharoubane

Let $G$ be the fundamental group of a graph of finitely generated virtually free groups with virtually cyclic edge groups. We shaw that $G$ is cohomologically good if $G$ is residually finite. If $G$ is LERF, we prove that G splits…

Group Theory · Mathematics 2026-03-18 Andrei Jaikin-Zapirain , Henrique Souza , Pavel Zalesski

Let S be a finite generating set of a torsion-free, nilpotent group G. We show that every automorphism of the Cayley graph Cay(G;S) is affine. (That is, every automorphism of the graph is obtained by composing a group automorphism with…

Combinatorics · Mathematics 2016-03-14 Dave Witte Morris , Joy Morris , Gabriel Verret

Let $\Gamma$ be a simple connect graph on a finite vertex set $V$ and let $A$ be its adjacency matrix. Then $\Gamma$ is said to be \textit{singular} if and only if $0$ is an eigenvalue of $A.$ The \textit{nullity (singularity)} of $\Gamma,$…

Combinatorics · Mathematics 2018-10-09 Ali Sltan Ali AL-Tarimshawy