Search arXivSearch

arXiv · 2506.05803

Finite $s$-geodesic transitive graphs under certain girths

Abstract

For an integer $s\geq1$ and a graph $Γ$, a path $(u_0, u_1, \ldots, u_{s})$ of vertices of $Γ$ is called an {\em $s$-geodesic} if it is a shortest path from $u_0$ to $u_{s}$. We say that $Γ$ is {\em $s$-geodesic transitive} if, for each $i\leq s$, $Γ$ has at least one $i$-geodesic, and its automorphism group is transitive on the set of $i$-geodesics. In 2021, Jin and Praeger [J. Combin. Theory Ser. A 178 (2021) 105349] have studied $3$-geodesic transitive graphs of girth $5$ or $6$, and they also proposed to the problem that to classify $s$-geodesic transitive graphs of girth $2s-1$ or $2s-2$ for $s=4, 5, 6, 7, 8$. The case of $s = 4$ was investigated in [J. Algebra Combin. 60 (2024) 949--963]. In this paper, we study such graphs with $s\geq5$. More precisely, it is shown that a connected $(G,s)$-geodesic transitive graph $Γ$ with a nontrivial intransitive normal subgroup $N$ of $G$ which has at least $3$ orbits, where $G$ is an automorphism group of $Γ$ and $s\geq 5$, either $Γ$ is the Foster graph and $Γ_N$ is the Tutte's $8$-cage, or $Γ$ and $Γ_N$ have the same girth and $Γ_N$ is $(G/N,s)$-geodesic transitive. Moreover, it is proved that if $G$ acts quasiprimitively on its vertex set, then $G$ is an almost simple group, and if $G$ acts biquasiprimitively, the stabilizer of biparts of $Γ$ in $G$ is an almost simple quasiprimitive group on each of biparts. In addition, $G$ cannot be primitive or biprimitive.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jun-Jie Huang. 2025-08-19. Finite $s$-geodesic transitive graphs under certain girths. https://arxiv.org/abs/2506.05803

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