Abstract
Let be a prime and let be either the intransitive permutation group of degree or the transitive permutation group of degree . Let be a connected -vertex-transitive and -edge-transitive graph and let be a vertex of . We show that if the permutation group induced by the vertex-stabiliser on the neighbourhood is isomorphic to then either , or is bounded by a constant depending only on , or is a very-well understood graph. This generalises a few recent results.
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.