English
Related papers

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

200 papers

For every odd prime power $q$, a family of pairwise nonisomorphic normal arc-transitive divisible design Cayley digraphs with isomorphic neighborhood designs over a Heisenberg group of order $q^3$ is constructed. It is proved that these…

Combinatorics · Mathematics 2024-11-11 Mikhail Muzychuk , Grigory Ryabov

Let $p$ be an odd prime, and $D_{2p}=\langle a,b\mid a^p=b^2=1,bab=a^{-1}\rangle$ the dihedral group of order $2p$. In this paper, we completely classify the cubic Cayley graphs on $D_{2p}$ up to isomorphism by means of spectral method. By…

Combinatorics · Mathematics 2017-08-29 Xueyi Huang , Qiongxiang Huang , Lu Lu

We study the automorphisms of graph products of cyclic groups, a class of groups that includes all right-angled Coxeter and right-angled Artin groups. We show that the group of automorphism generated by partial conjugations is itself a…

Group Theory · Mathematics 2009-10-27 Ruth Charney , Kim Ruane , Nathaniel Stambaugh , Anna Vijayan

Given a finite transitive permutation group $G\leq \operatorname{Sym}(\Omega)$, with $|\Omega|\geq 2$, the derangement graph $\Gamma_G$ of $G$ is the Cayley graph $\operatorname{Cay}(G,\operatorname{Der}(G))$, where $\operatorname{Der}(G)$…

Combinatorics · Mathematics 2021-09-07 Andriaherimanana Sarobidy Razafimahatratra

Let $\C$ be a genus 2 curve defined over $k$, $char (k) =0$. If $\C$ has a $(3,3)$-split Jacobian then we show that the automorphism group $Aut(\C)$ is isomorphic to one of the following: $\bZ_2, V_4, D_8$, or $D_{12}$. There are exactly…

Algebraic Geometry · Mathematics 2012-09-17 T. Shaska

A graph is called an integral graph when all eigenvalues of its adjacency matrix are integers. We study which Cayley graphs over a nonabelian group $$ T_{8n}=\left\langle a,b\mid a^{2n}=b^8=e,a^n=b^4,b^{-1}ab=a^{-1} \right \rangle $$ are…

Combinatorics · Mathematics 2025-08-15 Bei Ye , Xiaogang Liu

Let $S_n$ and $A_n$ denote the symmetric group and alternating group of degree $n$ with $n\geq 3$, respectively. Let $S$ be the set of all $3$-cycles in $S_n$. The \emph{complete alternating group graph}, denoted by $CAG_n$, is defined as…

Combinatorics · Mathematics 2017-08-29 Xueyi Huang , Qiongxiang Huang

A circulant is a Cayley graph over a cyclic group. A well-covered graph is a graph in which all maximal stable sets are of the same size, or in other words, they are all maximum. A CIS graph is a graph in which every maximal stable set and…

Combinatorics · Mathematics 2014-02-11 Endre Boros , Vladimir Gurvich , Martin Milanic

In this paper we introduce the concept of a Cayley graph automatic group (CGA group or graph automatic group, for short) which generalizes the standard notion of an automatic group. Like the usual automatic groups graph automatic ones enjoy…

Group Theory · Mathematics 2011-08-12 Olga Kharlampovich , Bakhadyr Khoussainov , Alexei Miasnikov

A linear algebraic group G is over a field K is called a Cayley group if it admits a Cayley map, i.e., a G-equivariant K-birational isomorphism between the group variety G and its Lie algebra. We prove that the special unitary group in 3…

Algebraic Geometry · Mathematics 2012-12-11 Mikhail Borovoi

A graph is said to be a bi-Cayley graph over a group H if it admits H as a group of automorphisms acting semiregularly on its vertices with two orbits. For a prime p, we call a bi-Cayley graph over a metacyclic p-group a bi-p-metacirculant.…

Combinatorics · Mathematics 2016-10-25 Yan-Li Qin , Jin-Xin Zhou

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

We show that there are Cayley automatic groups that are not Cayley biautomatic. In addition, we show that there are Cayley automatic groups with undecidable Conjugacy Problem and that the Isomorphism Problem is undecidable in the clas of…

Group Theory · Mathematics 2011-08-16 Alexei Miasnikov , Zoran Sunic

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

In this paper, we find a strong new restriction on the structure of CI-groups. We show that, if $R$ is a generalised dihedral group and if $R$ is a CI-group, then for every odd prime $p$ the Sylow $p$-subgroup of $R$ has order $p$, or $9$.…

Combinatorics · Mathematics 2020-08-05 Ted Dobson , Mikhail Muzychuk , Pablo Spiga

We investigate structural and combinatorial properties of Bi-Cayley graphs defined over cyclic groups of order $p^2q^2$, where $p$ and $q$ are distinct primes. We begin by describing their fundamental group-theoretic underpinnings. The main…

Combinatorics · Mathematics 2026-03-11 Iqbal Atmaja , Yeni Susanti , Ahmad Erfanian

There are a variety of ways to associate directed or undirected graphs to a group. It may be interesting to investigate the relations between the structure of these graphs and characterizing certain properties of the group in terms of some…

Group Theory · Mathematics 2017-05-23 A. R. Moghaddamfar , S. Rahbariyan , W. J. Shi

A graph $\G$ admitting a group $H$ of automorphisms acting semi-regularly on the vertices with exactly two orbits is called a {\em bi-Cayley graph\/} over $H$. Such a graph $\G$ is called {\em normal\/} if $H$ is normal in the full…

Combinatorics · Mathematics 2016-06-16 Marston Conder , Jin-Xin Zhou , Yan-Quan Feng , Mi-Mi Zhang

In [Distrance-regular Cayley graphs on dihedral groups, J. Combin. Theory Ser B 97 (2007) 14--33], Miklavi\v{c} and Poto\v{c}nik proposed the problem of characterizing distance-regular Cayley graphs, which can be viewed as an extension of…

Combinatorics · Mathematics 2023-08-29 Xiongfeng Zhan , Lu Lu , Xueyi Huang

In this paper, we begin by partitioning the edges (or arcs) of a circulant (di)graph according to which generator in the connection set leads to each edge. We then further refine the partition by subdividing any part that corresponds to an…

Combinatorics · Mathematics 2014-02-13 Joy Morris