Classifying Connected Pentavalent Symmetric Graphs of Order 40pq
Mathematics · 2026-03-02 · 14 (5) · 852
DOI: 10.3390/math14050852 ↗At a glance
Journal article in Mathematics, published online on 2026-03-02. Written by Jianghong Xu and 1 co-authors. 31 references. The full text is freely available (open access, CC BY 4.0). Funded by: Lincang City “Xinglin Talent” Support Plan, Talent Project Foundation of Yunnan Provincial Science and Technology Department.
Abstract (original language)
A graph is said to be symmetric if the action of its automorphism group on the set of arcs is transitive (arc-transitive). Building upon prior work regarding the classification of symmetric graphs of valency five, this article investigates connected symmetric graphs of order 40pq, where p and q are distinct primes. We establish that the full automorphism group of any such graph is isomorphic to Z5×PSL(2,479), PSL(2,479):D10, or Z5×(PSL(2,479):Z2). Moreover, the vertex stabilizers are shown to be isomorphic to A5 in the first instance and to S5 in the latter two cases.
Funding
- Lincang City “Xinglin Talent” Support Plan
- Talent Project Foundation of Yunnan Provincial Science and Technology Department
Cite
APA
Xu, J., & Fei, X. (2026). Classifying Connected Pentavalent Symmetric Graphs of Order 40pq. Mathematics, 14(5), 852. https://doi.org/10.3390/math14050852
Vancouver
Xu J, Fei X. Classifying Connected Pentavalent Symmetric Graphs of Order 40pq. Mathematics. 2026;14(5):852. doi:10.3390/math14050852
BibTeX
@article{Xu2026,
author = {Xu, Jianghong and Fei, Xiuhai},
title = {Classifying Connected Pentavalent Symmetric Graphs of Order 40pq},
journal = {Mathematics},
year = {2026},
volume = {14},
number = {5},
pages = {852},
doi = {10.3390/math14050852}
}
EUVIMED