Abstract
Let be a finite connected -vertex-transitive graph and let be a vertex of . If the permutation group induced by the action of the vertex-stabiliser on the neighbourhood is permutation isomorphic to , then is said to be locally-. A permutation group is graph-restrictive if there exists a constant such that, for every locally- pair and a vertex of , the inequality holds. We show that an intransitive group is graph-restrictive if and only if it is semiregular.
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.