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

We show that almost all circulant graphs have automorphism groups as small as possible. Of the circulant graphs that do not have automorphism group as small as possible, we give some families of integers such that it is not true that almost…

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…

A finite group $G$ admits an {\em oriented regular representation} if there exists a Cayley digraph of $G$ such that it has no digons and its automorphism group is isomorphic to $G$. Let $m$ be a positive integer. In this paper, we extend…

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$…

Let $G$ be a finite group and $m$ be an integer. We employ the notation $g_i$ to represent elements $(g,i)$ in the Cartesian product $G \times \mathbb{Z}_m$, where $\mathbb{Z}_m$ denotes integers modulo $m$. For given sets $T_{i,j}…

A graphical regular representation (GRR) of a group $G$ is a Cayley graph of $G$ whose full automorphism group is equal to the right regular permutation representation of $G$. Towards a proof of the conjecture that only finitely many finite…

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$…

In this paper we shall be looking at several results relating Schur rings to sufficient conditions for a graph to be a graphical regular representation (GRR) of a finite group, and then applying these specifically in the case of certain…

It is well known that the automorphism group of a regular dessin is a two-generator finite group, and the isomorphism classes of regular dessins with automorphism groups isomorphic to a given finite group $G$ are in one-to-one…

It has long been known that a vertex-transitive graph $\Gamma$ is isomorphic to a double coset graph $\text{Cos}(G,H,S)$ of a transitive group $G\le\text{Aut}(\Gamma)$, a vertex stabilizer $H\le G$, and some subset $S\subseteq G$. We show…

In this paper we are concerned with the classification of the finite groups admitting a bipartite DRR and a bipartite GRR. First, we find a natural obstruction in a finite group for not admitting a bipartite GRR. Then we give a complete…

A graph $\G$ with a group $H$ of automorphisms acting semiregularly on the vertices with two orbits is called a {\em bi-Cayley graph} over $H$. When $H$ is a normal subgroup of $\Aut(\G)$, we say that $\G$ is {\em normal} with respect to…

This is the third, and last, of a series of papers dealing with oriented regular representations. Here we complete the classification of finite groups that admit an oriented regular representation (or ORR for short), and give a complete…

Let $G$ be a finite group and $\text{cd}(G)$ denote the character degree set for $G$. The prime graph $\Delta(G)$ is a simple graph whose vertex set consists of prime divisors of elements in $\text{cd}(G)$, denoted $\rho(G)$. Two primes…

A metric space (X,d) is declared to be natural if (X,d) determines an up to isomorphism unique group structure (X,+) on the set X such that all the group translations and group inversion are isometries. A group is called natural if it…

Let $G$ be a group and $m$ a positive integer. We say an $m$-Cayley digraph $\Gamma$ over $G$ is a digraph that admits a group of automorphisms isomorphic to $G$ acting semiregularly on the vertex set with $m$ orbits. The digraph $\Sigma$…

A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular covers where this homomorphism is prescribed by the action of a semiregular subgroup of $\textrm{Aut}(G)$. We study…

The prime graph of a finite group $G$ is the labelled graph $\Gamma(G)$ with vertices the prime divisors of $|G|$ and edges the pairs $\{p,q\}$ for which $G$ contains an element of order $pq$. A group $G$ is recognisable by its prime graph…

Given a group $G$, an {\em $m$-Cayley digraph $\G$ over $G$} is a digraph that has a group of automorphisms isomorphic to $G$ acting semiregularly on the vertex set with $m$ orbits. We say that $G$ admits an {\em oriented $m$-semiregular…

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…