Search arXivSearch

arXiv · 1910.04931

On the automorphism groups of graphs with twice prime valency

Abstract

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 $Γ$ be a connected graph of odd order and twice prime valency, and let $G$ be a subgroup of the automorphism group of $\Ga$. In the case where $G$ acts transitively on the edges and quasiprimitively on the vertices of $\Ga$, we prove that either $G$ is almost simple or $G$ is a primitive group of affine type. If further $G$ is an almost simple primitive group then, with two exceptions, the socle of $G$ acts transitively on the edges of $Γ$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hong Ci Liao, Jing Jian Li, Zai Ping Lu. 2019-10-11. On the automorphism groups of graphs with twice prime valency. https://arxiv.org/abs/1910.04931

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO