English
Related papers

Related papers: Two-arc-transitive graphs of odd order -- II

200 papers

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 graph is half-arc-transitive if its automorphism group acts transitively on its vertex set, edge set, but not its arc set. In this paper, we study all tetravalent half-arc-transitive graphs of order $12p$.

Combinatorics · Mathematics 2022-06-01 M. Ghasemi , A. A. Talebi , N. Mehdipoor

A graph is said to be {\em vertex-transitive non-Cayley} if its full automorphism group acts transitively on its vertices and contains no subgroups acting regularly on its vertices. In this paper, a complete classification of cubic…

Combinatorics · Mathematics 2017-05-15 Wei-Juan Zhang , Yan-Quan Feng , Jin-Xin Zhou

It is well-known that every sharply 2-transitive group of characteristic 3 splits. Here we construct the first examples of non-split sharply 2-transitive groups in odd positive characteristic $p$, for sufficiently large primes $p$.…

Group Theory · Mathematics 2023-12-29 Marco Amelio , Simon André , Katrin Tent

We show that there exist functions $c$ and $g$ such that, if $k$, $n$ and $d$ are positive integers with $d> g(n)$ and $\Gamma$ is a $d$-valent $2$-arc-transitive graph of order $kp^n$ with $p$ a prime, then $p\leqslant kc(d)$. In other…

Combinatorics · Mathematics 2015-01-06 Luke Morgan , Eric Swartz , Gabriel Verret

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…

Combinatorics · Mathematics 2017-01-05 Yan-Li Qin , Jin-Xin Zhou

In this paper, we discuss the structural information about 2-arc-transitive (non-bipartite and bipartite) graphs of product action type. It is proved that a 2-arc-transitive graph of product action type requires certain restrictions on…

Combinatorics · Mathematics 2022-11-10 Zai Ping Lu

An {\em odd subgraph} of a graph is a subgraph in which every vertex has odd degree. A graph $G$ is said to be {\em odd $k$-edge-colorable} if there exists an edge-coloring $E(G) \rightarrow \{1,2, \ldots, k\}$ such that each non-empty…

Combinatorics · Mathematics 2026-04-20 Mikio Kano , Shun-ichi Maezawa , Kenta Ozeki

We prove that, in a finite group, if every rational irreducible character has odd degree, then all rational elements are 2-elements, as it was originally conjectured by Tiep and Tong-Viet.

Group Theory · Mathematics 2024-05-24 N. Grittini

A graph is vertex-transitive if its automorphism group acts transitively on vertices of the graph. A vertex-transitive graph is a Cayley graph if its automorphism group contains a subgroup acting regularly on its vertices. In this paper,…

Group Theory · Mathematics 2022-03-10 Majid Arezoomand , Mohsen Ghasemi , Mohammad A. Iranmanesh

A complete list of all connected arc-transitive asymmetric digraphs of in-valence and out-valence 2 on up to 1000 vertices is presented. As a byproduct, a complete list of all connected 4-valent graphs admitting a half-arc-transitive group…

Combinatorics · Mathematics 2013-11-11 Primoz Potocnik , Pablo Spiga , Gabriel Verret

We classify trivalent vertex-transitive graphs whose edge sets have a partition into a 2-factor composed of two cycles and a 1-factor that is invariant under the action of the automorphism group.

Combinatorics · Mathematics 2021-09-15 Brian Alspach , Ted Dobson , Afsaneh Khodadadpour , Primoz Šparl

A graph is edge-transitive if its automorphism group acts transitively on the edge set. In this paper, we investigate the automorphism groups of edge-transitive graphs of odd order and twice prime valency. Let $\Gamma$ be a connected graph…

Combinatorics · Mathematics 2019-10-14 Hong Ci Liao , Jing Jian Li , Zai Ping Lu

In this paper, we introduce the notion of 2-boundary planar graphs. A graph is 2-boundary planar if it has an embedding in the plane so that all vertices lie on the boundary of at most two faces and no edges are crossed. A proper coloring…

Combinatorics · Mathematics 2025-04-07 Weichan Liu , Mengke Qi , Xin Zhang

A {\em snark} is a cubic cyclically 4-edge connected graph with edge chromatic number four and girth at least five. We say that a graph $G$ is {\em odd 2-factored} if for each 2-factor F of G each cycle of F is odd. In this paper, we…

Combinatorics · Mathematics 2015-01-13 M. Abreu , D. Labbate , R. Rizzi , J. Sheehan

We classify all finite 2-groups that have a cyclic or dihedral maximal subgroup and determine their automorphism groups. Based on this result, we classify all pairs $ (G,\mathcal{M}) $, such that $ G $ is a finite 2-group and $ \mathcal{M}…

Group Theory · Mathematics 2025-08-11 Peice Hua

The groups which can act semisymmetrically on a cubic graph of twice odd order are determined modulo a normal subgroup which acts semiregularly on the vertices of the graph.

Group Theory · Mathematics 2007-05-23 Chris Parker

We give two lower bounds on the largest order of an arc-transitive graph of diameter two and a given degree.

Combinatorics · Mathematics 2013-12-24 Sanming Zhou

A new infinite family of bipartite cubic 3-arc transitive graphs is constructed and studied. They provide the first known examples admitting a 2-arc transitive vertex-biquasiprimitive group of automorphisms for which the index two subgroup…

Group Theory · Mathematics 2011-03-30 Alice Devillers , Michael Giudici , Cai Heng Li , Cheryl E. Praeger

In this paper, we determine the class of finite 2-arc-transitive bicirculants. We show that a connected $2$-arc-transitive bicirculant is one of the following graphs: $C_{2n}$ where $n\geqslant 2$, $\K_{2n}$ where $n\geqslant 2$, $\K_{n,n}$…

Combinatorics · Mathematics 2022-11-29 Wei Jin