A graph is {\em symmetric} or {\em arc-transitive} if its automorphism group is transitive on the arc set of the graph, and is {\em basic} if has no non-trivial normal subgroup such that the quotient graph has the same valency with . In this paper, we classify symmetric basic graphs of order and valency 5, where are two primes and is a positive integer. It is shown that such a graph is isomorphic to a family of Cayley graphs on dihedral groups of order with , the complete graph of order , the complete bipartite graph of order 10, or one of the nine sporadic coset graphs associated with non-abelian simple groups. As an application, connected pentavalent symmetric graphs of order for some small integers and are classified.

生成讲解博客的中文版本

生成AI智能校验的中文版本