Pentavalent Symmetric Graphs of Order 16p  

作　　者：Song-tao GUO Hai-long HOU Jiang-tao SHI 

机构地区：[1]School of Mathematics and Statistics,Henan University of Science and Technology [2]School of Mathematics and Information Science,Yantai University

出　　处：《Acta Mathematicae Applicatae Sinica》2017年第1期115-124,共10页应用数学学报（英文版）

基　　金：Supported by the National Natural Science Foundation of China(No.11301154,11301151,11201401,11271012);the Key Project of Education Department of Henan Province Scientific and Technological Research(No.13A110249);the Scientific Research Foundation for Doctoral Scholars of HAUST(No.09001707)

摘　　要：A graph is said to be symmetric if its automorphism group acts transitively on its arcs. In this paper, a complete classification of connected pentavalent symmetric graphs of order 16p is given for each prime p. It follows from this result that a connected pentavalent symmetric graph of order 16p exists if and only if p = 2 or 31, and that up to isomorphism, there are three such graphs.A graph is said to be symmetric if its automorphism group acts transitively on its arcs. In this paper, a complete classification of connected pentavalent symmetric graphs of order 16p is given for each prime p. It follows from this result that a connected pentavalent symmetric graph of order 16p exists if and only if p = 2 or 31, and that up to isomorphism, there are three such graphs.

关 键 词：symmetric graph s-transitive graph s-regular graph 

分 类 号：O157.5[理学—数学] O614.611[理学—基础数学]