On edge-primitive and 2-arc-transitive graphs
Combinatorics
2019-01-11 v2
Abstract
A graph is edge-primitive if its automorphism group acts primitively on the edge set. In this short paper, we prove that a finite 2-arc-transitive edge-primitive graph has almost simple automorphism group if it is neither a cycle nor a complete bipartite graph. We also present two examples of such graphs, which are 3-arc-transitive and have faithful vertex-stabilizers.
Cite
@article{arxiv.1812.10880,
title = {On edge-primitive and 2-arc-transitive graphs},
author = {Zaiping Lu},
journal= {arXiv preprint arXiv:1812.10880},
year = {2019}
}