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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.