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.
机构:
Yunnan Univ, Sch Math & Stat, Kunming 650031, Yunnan, Peoples R China
Xichang Univ, Sch Sci, Xichang 615000, Peoples R ChinaYunnan Univ, Sch Math & Stat, Kunming 650031, Yunnan, Peoples R China
Ma, Yulong
Lou, Bengong
论文数: 0引用数: 0
h-index: 0
机构:
Yunnan Univ, Sch Math & Stat, Kunming 650031, Yunnan, Peoples R ChinaYunnan Univ, Sch Math & Stat, Kunming 650031, Yunnan, Peoples R China
机构:
Kharazmi Univ, Fac Math Sci & Comp, 50 Taleghani Ave, Tehran 1561836314, IranKharazmi Univ, Fac Math Sci & Comp, 50 Taleghani Ave, Tehran 1561836314, Iran
Salarian, M. Reza
Abedi, Fateme
论文数: 0引用数: 0
h-index: 0
机构:
Kharazmi Univ, Fac Math Sci & Comp, 50 Taleghani Ave, Tehran 1561836314, IranKharazmi Univ, Fac Math Sci & Comp, 50 Taleghani Ave, Tehran 1561836314, Iran