English
Related papers

Related papers: Trivalent dihedrants and bi-dihedrants

200 papers

A bicirculant is a regular graph that admits an automorphism having two vertex-orbits of the same size. A bicirculant can be described as follows. Given an integer $m \ge 1$ and sets $R, S, T \subseteq \mathbb Z_m$ such that $R=-R$, $T=-T$,…

Combinatorics · Mathematics 2026-04-24 Simona Bonvicini , Tomaž Pisanski , Arjana Žitnik

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 resolve two problems of [Cameron, Praeger, and Wormald -- Infinite highly arc transitive digraphs and universal covering digraphs, Combinatorica 1993]. First, we construct a locally finite highly arc-transitive digraph with universal…

Combinatorics · Mathematics 2013-10-14 Matt DeVos , Bojan Mohar , Robert Šámal

We propose a definition of the rotation number for transverse graph diagrams, extending the classical notion of the rotation number for plane curves. Using this, we introduce a normalized multi-variable Alexander polynomial for framed,…

Geometric Topology · Mathematics 2025-12-01 Yuanyuan Bao , Zhongtao Wu

We prove that, given a finite graph $\Sigma$ satisfying some mild conditions, there exist infinitely many tetravalent half-arc-transitive normal covers of $\Sigma$. Applying this result, we establish the existence of infinite families of…

Combinatorics · Mathematics 2020-11-25 Pablo Spiga , Binzhou Xia

A classification is given for factorizations of almost simple groups with at least one factor solvable, and it is then applied to characterize $s$-arc-transitive Cayley graphs of solvable groups, leading to a striking corollary: Except the…

Group Theory · Mathematics 2016-02-29 Cai Heng Li , Binzhou Xia

A connected graph $\Gamma=(V,E)$ of valency at least $3$ is called a basic $2$-arc-transitive graph if its full automorphism group has a subgroup $G$ with the following properties: (i) $G$ acts transitively on the set of $2$-arcs of…

Combinatorics · Mathematics 2022-10-11 Zai Ping Lu , Ruo Yu Song

We study bipartite distance-regular Cayley graphs with diameter three or four. We give sufficient conditions under which a bipartite Cayley graph can be constructed on the semidirect product of a group -- the part of this bipartite Cayley…

Combinatorics · Mathematics 2022-03-30 Edwin R. van Dam , Mojtaba Jazaeri

A graph $\Gamma$ is basic if Aut$\Gamma$ has no normal subgroup $N\ne1$ such that $\Gamma$ is a normal cover of the normal quotient graph $\Gamma_N$. In this paper, we completely determine the basic normal quotient graphs of all connected…

Combinatorics · Mathematics 2019-06-25 Jiangmin Pan , Junjie Huang , Chao Wang

A Cayley digraph $\rm{Cay}(G,S)$ of a group $G$ with respect to a subset $S$ of $G$ is called a CI-digraph if for any Cayley digraph $\rm{Cay}(G,T)$ isomorphic to $\rm{Cay}(G,S)$, there is an $\alpha\in \rm{Aut}(G)$ such that $S^\alpha=T$.…

Combinatorics · Mathematics 2022-10-24 Jin-Hua Xie , Yan-Quan Feng , Young Soo Kwon

In this paper we consider bi-Cohen-Macaulay graphs, and give a complete classification of such graphs in the case they are bipartite or chordal. General bi-Cohen-Macaulay graphs are classified up to separation. The inseparable…

Commutative Algebra · Mathematics 2015-08-31 Jürgen Herzog , Ahad Rahimi

A simple undirected graph is said to be {\em semisymmetric} if it is regular and edge-transitive but not vertex-transitive. Every semisymmetric graph is a bipartite graph with two parts of equal size. It was proved in [{\em J. Combin.…

Combinatorics · Mathematics 2012-06-12 Li Wang , Shaofei Du

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

Every finite, self-dual, regular (or chiral) 4-polytope of type {3,q,3} has a trivalent 3-transitive (or 2-transitive) medial layer graph. Here, by dropping self-duality, we obtain a construction for semisymmetric trivalent graphs (which…

Combinatorics · Mathematics 2007-05-23 Barry Monson , Tomaz Pisanski , Egon Schulte , Asia Ivic Weiss

A graph $\Gamma$ of even order is a bicirculant if it admits an automorphism with two orbits of equal length. Symmetry properties of bicirculants, for which at least one of the induced subgraphs on the two orbits of the corresponding…

Combinatorics · Mathematics 2024-12-09 Robert Jajcay , Štefko Miklavič , Primož Šparl , Gorazd Vasiljević

In this paper the structure of the Cayley graphs and G-graphs of some gyro-groups are studied and some properties of them will be proved. Moreover we review some special gyro-groups including: gyro-commutative gyrogroups, dihedral…

Combinatorics · Mathematics 2024-05-01 Neda Moradi , Gholam Hossein Fath-Tabara , Alain Bretto

A pseudo-triangle is a simple polygon with exactly three convex vertices, and all other vertices (if any) are distributed on three concave chains. A pseudo-triangulation~$\mathcal{T}$ of a point set~$P$ in~$\mathbb{R}^2$ is a partitioning…

Computational Geometry · Computer Science 2024-02-20 Maarten Löffler , Tamara Mchedlidze , David Orden , Josef Tkadlec , Jules Wulms

We first recall the basic theory of double vector bundles and the canonical pairing of their duals introduced by the author and by Konieczna and Urbanski. We then show that the relationship between a double vector bundle and its two duals…

Symplectic Geometry · Mathematics 2007-05-23 Kirill C. H. Mackenzie

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

Group Theory · Mathematics 2025-07-15 Songnian Xu , Dein Wong , Chi Zhang , Wenhao Zhen

We show that every finitely generated group G with an element of order at least $(5rank(G))^{12}$ admits a locally finite directed Cayley graph with automorphism group equal to G. If moreover G is not generalized dihedral, then the above…

Combinatorics · Mathematics 2025-04-02 Paul-Henry Leemann , Mikael de la Salle