English
Related papers

Related papers: Arc-transitive bicirculants

200 papers

We extend the notion of an $H$-normal quotient digraph of an $H$-vertex-transitive digraph to that of an $H$-subnormal quotient digraph. Using these concepts, together with bipartite halves of bipartite digraphs, we show that, for each…

Combinatorics · Mathematics 2025-12-22 Lei Chen , Cheryl Praeger

A graph is called {\em arc-transitive} (or {\em symmetric}) if its automorphism group has a single orbit on ordered pairs of adjacent vertices, and 2-arc-transitive its automorphism group has a single orbit on ordered paths of length 2. In…

Group Theory · Mathematics 2014-09-30 Marston D. E. Conder , Cai-Heng Li , Primoz Potocnik

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

We solve the long-standing existence problem of vertex-primitive 2-arc-transitive digraphs by constructing an infinite family of such digraphs.

Combinatorics · Mathematics 2017-05-04 Michael Giudici , Cai Heng Li , Binzhou Xia

A graph Gamma is said to be 2-arc-transitive if its full automorphism group Aut(\Gamma) has a single orbit on ordered paths of length 2, and for G\leq Aut(\Gamma), \Gamma is G-regular if G is regular on the vertex set of \Gamma. Let G be a…

Group Theory · Mathematics 2017-01-06 Jia-Li Du , Yan-Quan Feng

We investigate connected cubic vertex-transitive graphs whose edge sets admit a partition into a $2$-factor $\mathcal{C}$ and a $1$-factor that is invariant under a vertex-transitive subgroup of the automorphism group of the graph and where…

Combinatorics · Mathematics 2026-01-19 Brian Alspach , Primoz Sparl

Let $\Gamma$ be a finite X-symmetric graph with a nontrivial X-invariant partition $\mathcal {B}$ on $V(\Gamma)$ such that $\Gamma_{\mathcal {B}}$ is a connected (X,2)-arc-transitive graph and $\Gamma$ is not a multicover of…

Combinatorics · Mathematics 2009-06-02 Bin Jia , Zaiping Lu , Gaixia Wang

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…

Combinatorics · Mathematics 2016-07-15 Jin-Xin Zhou

It is well-known that a simple $G$-arc-transitive graph can be represented as a coset graph for the group $G$. This representation is extended to a construction of $G$-arc-transitive coset graphs $\Cos(G,H,J)$ with finite valency and finite…

Combinatorics · Mathematics 2022-02-16 Cai Heng Li , Cheryl E. Praeger , Shu Jiao Song

A graph $G = (V, E)$ is said to be word-representable if a word $w$ can be formed using the letters of the alphabet $V$ such that for every pair of vertices $x$ and $y$, $xy \in E$ if and only if $x$ and $y$ alternate in $w$. A…

Combinatorics · Mathematics 2026-01-29 Eshwar Srinivasan , Ramesh Hariharasubramanian

We first characterize all faithful arc-transitive covers of complete graphs and we give a general construction of such covers. For a counterpart of cover, we say a graph $\Gamma$ is a pseudocover of its quotient $\Sigma$ if they have the…

Combinatorics · Mathematics 2022-11-01 Yan Zhou Zhu

In this paper, we study the relationship between the radius $r$ and the attachment number $a$ of a tetravalent graph admitting a half-arc-transitive group of automorphisms. These two parameters were first introduced in~[{\em…

Combinatorics · Mathematics 2024-12-09 Primož Potočnik , Primož Šparl

A tetravalent $2$-arc-transitive graph of order $728$ is either the known $7$-arc-transitive incidence graph of the classical generalized hexagon $GH(3,3)$ or a normal cover of a $2$-transitive graph of order $182$ denoted $A[182,1]$ or…

Combinatorics · Mathematics 2018-10-18 Hui Zhou

We investigate the structure of connected graphs, not necessarily locally finite, with infinitely many ends. On the one hand we study end-transitive such graphs and on the other hand we study such graphs with the property that the…

Combinatorics · Mathematics 2010-03-19 Matthias Hamann

The theory of voltage graphs has become a standard tool in the study graphs admitting a semiregular group of automorphisms. We introduce the notion of a cyclic generalised voltage graph to extend the scope of this theory to graphs admitting…

Combinatorics · Mathematics 2020-03-12 Primoz Potocnik , Micael Toledo

We determine all factorisations $X=AB$, where $X$ is a finite almost simple group and $A,B$ are core-free subgroups such that $A\cap B$ is cyclic or dihedral. As a main application, we classify the graphs $\Gamma$ admitting an almost simple…

Group Theory · Mathematics 2024-05-24 Martin W. Liebeck , Cheryl E. Praeger

We consider latin square graphs $\Gamma = \rm{LSG}(H)$ of the Cayley table of a given finite group $H$. We characterize all pairs $(\Gamma,G)$, where $G$ is a subgroup of autoparatopisms of the Cayley table of $H$ such that $G$ acts…

Combinatorics · Mathematics 2017-09-19 Carmen Amarra

In this paper, we study arc-transitive Cayley graphs on non-abelian simple groups with soluble stabilizers and valency seven. Let $\Ga$ be such a Cayley graph on a non-abelian simple group $T$. It is proved that either $\Ga$ is a normal…

Combinatorics · Mathematics 2017-08-01 Jiangmin Pan , Fugang Yin , Bo Ling

Building on earlier work of Biggs, James, Wilson and the author, and using the Graver-Watkins description of the 14 classes of edge-transitive maps, we complete the classification of the edge-transitive embeddings of complete graphs.

Combinatorics · Mathematics 2019-08-06 Gareth A. Jones

A vertex triple $(u,v,w)$ of a graph is called a $2$-geodesic if $v$ is adjacent to both $u$ and $w$ and $u$ is not adjacent to $w$. A graph is said to be $2$-geodesic transitive if its automorphism group is transitive on the set of…

Combinatorics · Mathematics 2022-07-28 Jun-Jie Huang , Yan-Quan Feng , Jin-Xin Zhou , Fu-Gang Yin