相关论文: Using mixed dihedral groups to construct normal Ca…
A 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, for each $n\geq 2$, we construct a…
We introduce the notion of an \emph{$n$-dimensional mixed dihedral group}, a general class of groups for which we give a graph theoretic characterisation. In particular, if $H$ is an $n$-dimensional mixed dihedral group then the we…
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…
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…
Let $G$ be a finite group and let $S$ be an inverse-closed subset of $G$ not containing the identity. The Cayley graph $\mathrm{Cay}(G,S)$ has vertex set $G$, where two vertices $x$ and $y$ are adjacent if and only if $x^{-1}y \in S$.…
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…
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…
For a finite group $G$ and subset $S$ of $G,$ the Haar graph $H(G,S)$ is a bipartite regular graph, defined as a regular $G$-cover of a dipole with $|S|$ parallel arcs labelled by elements of $S$. If $G$ is an abelian group, then $H(G,S)$…
In this paper we introduce and study a type of Cayley graph -- subnormal Cayley graph. We prove that a subnormal 2-arc transitive Cayley graph is a normal Cayley graph or a normal cover of a complete bipartite graph $K_{p^d,p^d}$ with $p$…
A Cayley graph $\Ga=\Cay(G,S)$ is said to be normal if $G$ is normal in $\Aut\Ga$. The concept of normal Cayley graphs was first proposed by M.Y.Xu in [Discrete Math. 182, 309-319, 1998] and it plays an important role in determining the…
A regular cover of a connected graph is called {\em cyclic} or {\em dihedral} if its transformation group is cyclic or dihedral respectively, and {\em arc-transitive} (or {\em symmetric}) if the fibre-preserving automorphism subgroup acts…
A graph $\Gamma$ is a bi-Cayley graph over a group $G$ if $G$ is a semiregular group of automorphisms of $\Gamma$ having two orbits. Let $G$ be a non-abelian metacyclic $p$-group for an odd prime $p$, and let $\Gamma$ be a connected…
A finite simple graph is called a bi-Cayley graph over a group $H$ if it has a semiregular automorphism group, isomorphic to $H,$ which has two orbits on the vertex set. Cubic vertex-transitive bi-Cayley graphs over abelian groups have been…
A non-complete graph is \emph{$2$-distance-transitive} if, for $i=1,2$ and for any two vertex pairs $(u_1,v_1)$ and $(u_2,v_2)$ with the same distance $i$ in the graph, there exists an element of the graph automorphism group that maps…
An interesting fact is that most of the known connected $2$-arc-transitive nonnormal Cayley graphs of small valency on finite simple groups are $(\mathrm{A}_{n+1},2)$-arc-transitive Cayley graphs on $\mathrm{A}_n$. This motivates the study…
A Cayley graph of a group $H$ is a finite simple graph $\Gamma$ such that ${\rm Aut}(\Gamma)$ contains a subgroup isomorphic to $H$ acting regularly on $V(\Gamma)$, while a Haar graph of $H$ is a finite simple bipartite graph $\Sigma$ such…
It was proved in [Y.-Q. Feng, C. H. Li and J.-X. Zhou, Symmetric cubic graphs with solvable automorphism groups, {\em European J. Combin.} {\bf 45} (2015), 1-11] that a cubic symmetric graph with a solvable automorphism group is either a…
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. A non-abelian group is called an inner-abelian group if all of its proper subgroups are…
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…
We characterize connected tetravalent graphs $\Gamma$ which admit groups $M<H$ of automorphisms such that $\Gamma$ is $M$-half-arc-transitive and $H$-arc-transitive. Examples for each case are constructed, including a counter-example to a…