English
Related papers

Related papers: $\mathbb Z_3^8$ is not a CI-group

200 papers

A finite group $G$ is a "non-DCI group" if there exist subsets $S_1$ and $S_2$ of $G$, such that the associated Cayley digraphs $C\overrightarrow{ay}(G;S_1)$ and $C\overrightarrow{ay}(G;S_2)$ are isomorphic, but no automorphism of $G$…

Combinatorics · Mathematics 2023-03-08 Dave Witte Morris , Joy Morris

A finite group R is a CI-group if, whenever S and T are subsets of R with the Cayley graphs Cay(R,S) and Cay(R,T) isomorphic, there exists an automorphism x of R with S^x=T. The classification of CI-groups is an open problem in the theory…

Combinatorics · Mathematics 2014-02-20 Edward Dobson , Joy Morris , Pablo Spiga

A Cayley digraph Cay(G,S) of a finite group $G$ with respect to a subset $S$ of $G$ is said to be a CI-digraph if for every Cayley digraph Cay(G,T) isomorphic to Cay(G,S), there exists an automorphism $\sigma$ of $G$ such that $S^\sigma=T$.…

Combinatorics · Mathematics 2024-02-22 Jin-Hua Xie , Yan-Quan Feng , Binzhou Xia

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 Cayley digraph $\Gamma$ over a finite group $G$ is said to be CI if for every Cayley digraph $\Gamma^\prime$ over $G$ isomorphic to $\Gamma$, there is an isomorphism from $\Gamma$ to $\Gamma^\prime$ which is at the same time an…

Combinatorics · Mathematics 2025-03-04 Grigory Ryabov

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_4\times C_p^2$, where $p$ is a prime, is a…

Combinatorics · Mathematics 2021-05-26 Grigory Ryabov

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

A Cayley (di)graph $Cay(G,S)$ of a group $G$ with respect to $S$ is said to be normal if the right regular representation of $G$ is normal in the automorphism group of $Cay(G,S)$, and is called a CI-(di)graph if there is $\alpha\in Aut(G)$…

Combinatorics · Mathematics 2021-06-03 Jin-Hua Xie , Yan-Quan Feng , Jin-Xin Zhou

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

A finite group $G$ is a DCI-group if, whenever $S$ and $S'$ are subsets of $G$ with the Cayley graphs Cay$(G,S)$ and Cay$(G,S')$ isomorphic, there exists an automorphism $\varphi$ of $G$ with $\varphi(S)=S'$. It is a CI-group if this…

Combinatorics · Mathematics 2015-02-24 Joy Morris

A Cayley (di)graph $Cay(G,S)$ of a group $G$ with respect to a subset $S$ of $G$ is called normal if the right regular representation of $G$ is a normal subgroup in the full automorphism group of $Cay(G,S)$, and is called a CI-(di)graph if…

Combinatorics · Mathematics 2021-05-18 Jin-Hua Xie , Yan-Quan Feng , Grigory Ryabov , Ying-Long Liu

The isomorphism problem of Cayley graphs has been well studied in the literature, such as characterizations of CI (DCI)-graphs and CI (DCI)-groups. In this paper, we generalize these to vertex-transitive graphs and establish parallel…

Combinatorics · Mathematics 2016-03-29 Jing Chen , Binzhou Xia

A finite group $G$ is a called a DCI-group if any two isomorphic Cayley digraphs of $G$ are also isomorphic via an automorphism of $G$. If $G$ is a non-abelian generalised dihedral DCI-group, then Dobson, Muzychuk, and Spiga proved that $G$…

Group Theory · Mathematics 2025-09-04 István Kovács , Gábor Somlai

In this paper, we show that the group $\mathbb{Z}_p^5$ is a DCI-group for any odd prime $p,$ that is, two Cayley digraphs Cay$(\mathbb{Z}_p^5,S)$ and Cay$(\mathbb{Z}_p^5,T)$ are isomorphic if and only if $S=T^\varphi$ for some automorphism…

Combinatorics · Mathematics 2017-05-09 Yan-Quan Feng , István Kovács

For every prime $p > 3$ and for every prime $q>p^3$ we prove that $\mathbb{Z}_q \times \mathbb{Z}_p^3$ is a DCI-group.

Group Theory · Mathematics 2013-12-31 Gábor Somlai

This paper investigates the enumeration of Cayley digraphs, focusing on counting Cayley digraphs on dihedral groups up to CI-isomorphism. By leveraging the Cauchy-Frobenius Lemma and properties of automorphisms, we derive an explicit…

Combinatorics · Mathematics 2025-07-30 Zai Ping Lu , Jia Yin Xie , Jin-Hua Xie

A Cayley graph of a group $H$ is a finite simple graph $\Gamma$ such that its automorphism group ${\rm Aut}(\Gamma)$ contains a subgroup isomorphic to $H$ acting regularly on $V(\Gamma)$, while a Haar graph of $H$ is a finite simple…

Combinatorics · Mathematics 2019-08-14 Yan-Quan Feng , István Kovács , Jie Wang , Da-Wei Yang

Let $m$ be a positive integer. A group $G$ is said to be an $m$-DCI-group or an $m$-CI-group if $G$ has the $k$-DCI property or $k$-CI property for all positive integers $k$ at most $m$, respectively. Let $G$ be a dihedral group of order…

Combinatorics · Mathematics 2024-07-18 Jin-Hua Xie , Zai Ping Lu , Yan-Quan Feng

We prove that the group $C_p^4\times C_q$ is a DCI-group for distinct primes $p$ and $q$, that is, two Cayley digraphs over $C_p^4 \times C_q$ are isomorphic if and only if their connection sets are conjugate by a group automorphism.

Combinatorics · Mathematics 2022-01-11 István Kovács , Grigory Ryabov
‹ Prev 1 2 3 10 Next ›