On basic graphs of symmetric graphs of valency five

2017/07/17 by Da-Wei Yang, Yang, Da-Wei, Yan‐Quan Feng +5
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1707.04969

openalex publication_date 2017/07/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

A graph \G is \em symmetric or \em arc-transitive if its automorphism group \Aut(\G) is transitive on the arc set of the graph, and \G is \em basic if \Aut(\G) has no non-trivial normal subgroup N such that the quotient graph \G_N has the same valency with \G. In this paper, we classify symmetric basic graphs of order 2qpⁿ and valency 5, where q

Related

• Symmetric graphs of valency seven and their basic normal quotient graphs
• On basic 2-arc-transitive graphs
• Pentavalent symmetric graphs admitting vertex-transitive non-abelian simple groups
• Symmetric graphs with 2-arc transitive quotients
• On the orders of arc-transitive graphs