On the stabilisers of locally 2-transitive graphs
arXiv:1603.08398
Abstract
For a connected locally )-arc-transitive graph with and an edge , determining the amalgam is a fundamental problem in the area of symmetrical graph theory, but it is very difficult. In this paper, we give a classification of in the case where the vertex stabilisers and are faithful on their neighbourhoods, which shows that except for the case , there are exactly 16 such triples.