Edge-Transitive 8-Valent Graphs of Order 9p

A graph is edge-transitive if its automorphism group acts transitively on the set of edges of the graph. In this paper, we classify edge-transitive 8-valent graphs of order [Formula: see text] for each prime [Formula: see text].

Authors

Institutions

Publication Details

Journal
Algebra Colloquium
Published
2026-05-13
DOI
https://doi.org/10.1142/s1005386726000210
Primary Topic
Finite Group Theory Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Edge-Transitive 8-Valent Graphs of Order 9p

Meiyu Xu, Songtao Guo, Bo Deng
Algebra Colloquium
Finite Group Theory Research
article

Edge-Transitive 8-Valent Graphs of Order 9p

Meiyu Xu, Songtao Guo, Bo Deng
article en

Abstract

A graph is edge-transitive if its automorphism group acts transitively on the set of edges of the graph. In this paper, we classify edge-transitive 8-valent graphs of order [Formula: see text] for each prime [Formula: see text].

Algebra ColloquiumVol. 33(02)
Henan University of Science and Technology (CN)
Reduced inequalities
Openalex Percentile: Top 4%
Finite Group Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.