On the stabilisers of locally 2-transitive graphs

Abstract

For a connected locally (G,s)-arc-transitive graph with s≥slant 2 and an edge v,w, determining the amalgam (Gv,Gw,Gvw) is a fundamental problem in the area of symmetrical graph theory, but it is very difficult. In this paper, we give a classification of (Gv,Gw,Gvw) in the case where the vertex stabilisers Gv and Gw are faithful on their neighbourhoods, which shows that except for the case Gv Gw, there are exactly 16 such triples.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…