On weakly symmetric graphs of order twice a prime square

被引：6
|
作者：
Zhou, Jin-Xin [1 ]
Zhang, Mi-Mi [1 ]
机构：
[1] Beijing Jiaotong Univ, Math, Beijing 100044, Peoples R China
来源：
JOURNAL OF COMBINATORIAL THEORY SERIES A | 2018年 / 155卷
基金：
中国国家自然科学基金;
关键词：
Weakly symmetric; Half-arc-transitive; Bi-Cayley graph; PRIMITIVE PERMUTATION-GROUPS; ARC-TRANSITIVE GRAPHS; 2 DISTINCT PRIMES; DIGRAPHS; CLASSIFICATION; AUTOMORPHISMS; PRODUCT; SUBGROUPS; POWER;
D O I：
10.1016/j.jcta.2017.11.016
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A graph is weakly symmetric if its automorphism group is both vertex-transitive and edge-transitive. In 1971, Chao characterized all weakly symmetric graphs of prime order and showed that such graphs are also arc-transitive. In 1987, Cheng and Oxley determined all weakly symmetric graphs of order twice a prime and showed that these graphs are arc transitive, too. In this paper, a characterization of weakly symmetric graphs of order twice a prime square is given, and it shows that these graphs are also arc-transitive. (C) 2017 Elsevier Inc. All rights reserved.
引用
收藏
页码：458 / 475
页数：18
相关论文
共 50 条
12345