English
Related papers

Related papers: Vertex-primitive s-arc-transitive digraphs of symp…

200 papers

We study groups acting vertex-transitively on connected, trivalent graphs such that stabilizers of vertices are infinite. If the action is edge-transitive, we prove that the graph has to be a tree. We analyze the case where the action is…

Combinatorics · Mathematics 2021-01-12 Arnbjörg Soffía Árnadóttir , Waltraud Lederle , Rögnvaldur G. Möller

In this paper, we characterise the family of finite arc-transitive bicirculants. We show that every finite arc-transitive bicirculant is a normal $r$-cover of an arc-transitive graph that lies in one of eight infinite families or is one of…

Combinatorics · Mathematics 2022-01-25 Alice Devillers , Michael Giudici , Wei Jin

This paper deals with finite cubic ($3$-regular) graphs whose automorphism group acts transitively on the edges of the graph. Such graphs split into two broad classes, namely arc-transitive and semisymmetric cubic graphs, and then these…

Combinatorics · Mathematics 2025-02-05 Marston Conder , Primož Potočnik

We classify all the $2$-arc-transitive strongly regular graphs, and use this classification to study the family of finite $(G,3)$-geodesic-transitive graphs of girth $4$ or $5$ for some group $G$ of automorphisms. For this application we…

Combinatorics · Mathematics 2019-04-03 Wei Jin , Cheryl E. Praeger

The finite sharply $2$-transitive groups were classified by Zassenhaus in the 1930's. They essentially all look like the group of affine linear transformations $x\mapsto ax+b$ for some field (or at least near-field) $K$. However, the…

Group Theory · Mathematics 2016-04-06 Katrin Tent

We investigate the structure of a digraph having a transitive automorphism group where every cutset of minimal cardinality consists of all successors or all predecessors of some vertex. We improve most of the existing results in this area.

Combinatorics · Mathematics 2010-06-29 Y. O. Hamidoune , A. Lladó , S. C. López

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

A directed graph is semi-transitive if and only if it is acyclic and for any directed path $u_1\rightarrow u_2\rightarrow \cdots \rightarrow u_t$, $t \geq 2$, either there is no edge from $u_1$ to $u_t$ or all edges $u_i\rightarrow u_j$…

Combinatorics · Mathematics 2021-08-13 Kittitat Iamthong , Sergey Kitaev

In this article, we study $2$-$(v,k,\lambda)$ designs $\mathcal{D}$ with $\lambda$ prime admitting flag-transitive and point-primitive almost simple automorphism groups $G$ with socle $T$ a finite exceptional simple group or a sporadic…

Group Theory · Mathematics 2025-05-09 Seyed Hassan Alavi , Ashraf Daneshkhah , Alessandro Montinaro

The subdivision graph $S(\Sigma)$ of a graph $\Sigma$ is obtained from $\Sigma$ by `adding a vertex' in the middle of every edge of $\Si$. Various symmetry properties of $\S(\Sigma)$ are studied. We prove that, for a connected graph…

Group Theory · Mathematics 2011-01-19 Ashraf Daneshkhah , Alice Devillers , Cheryl E. Praeger

A graph is called cubic and tetravalent if all of its vertices have valency 3 and 4, respectively. It is called vertex-transitive and arc-transitive if its automorphism group acts transitively on its vertex-set and on its arc- set,…

Combinatorics · Mathematics 2012-01-26 Primoz Potocnik , Pablo Spiga , Gabriel Verret

In 1982, Durnberger proved that every connected Cayley graph of a finite group with a commutator subgroup of prime order contains a hamiltonian cycle. In this paper, we extend this result to the infinite case. Additionally, we generalize…

Combinatorics · Mathematics 2024-12-12 Florian Lehner , Farzad Maghsoudi , Babak Miraftab

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

Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is well-known. A general…

Group Theory · Mathematics 2009-05-08 M. J. Dunwoody

From the point of view of discrete geometry, the class of locally finite transitive graphs is a wide and important one. The subclass of Cayley graphs is of particular interest, as testifies the development of geometric group theory. Recall…

Combinatorics · Mathematics 2016-12-06 Sébastien Martineau

A graph $\Gamma$ is called $(G, s)$-arc-transitive if $G \le \mathrm{Aut}(\Gamma)$ is transitive on the set of vertices of $\Gamma$ and the set of $s$-arcs of $\Gamma$, where for an integer $s \ge 1$ an $s$-arc of $\Gamma$ is a sequence of…

Combinatorics · Mathematics 2021-02-15 Xin Gui Fang , Jie Wang , Sanming Zhou

We classify non-complete prime valency graphs satisfying the property that their automorphism group is transitive on both the set of arcs and the set of $2$-geodesics. We prove that either $\Gamma$ is 2-arc transitive or the valency $p$…

Combinatorics · Mathematics 2015-04-20 Alice Devillers , Wei Jin , Cai Heng Li , Cheryl E. Praeger

We classify finite primitive permutation groups having a suborbit of length 5. As a corollary, we obtain a classification of finite vertex-primitive graphs of valency 5. In the process, we also classify finite almost simple groups that have…

It is shown that each subgroup of odd index in an alternating group of degree at least 10 has all insoluble composition factors to be alternating. A classification is then given of 2-arc-transitive graphs of odd order admitting an…

Combinatorics · Mathematics 2021-05-11 Cai Heng Li , Jing Jian Li , Zai Ping Lu
‹ Prev 1 4 5 6 7 8 10 Next ›