Vertex-primitive digraphs having vertices with almost equal neighbourhoods
Combinatorics
2015-01-22 v1 Group Theory
Abstract
We consider vertex-primitive digraphs having two vertices with almost equal neighbourhoods (that is, the set of vertices that are neighbours of one but not the other is small). We prove a structural result about such digraphs and then apply it to answer a question of Ara\'ujo and Cameron about synchronising groups.
Keywords
Cite
@article{arxiv.1501.05046,
title = {Vertex-primitive digraphs having vertices with almost equal neighbourhoods},
author = {Pablo Spiga and Gabriel Verret},
journal= {arXiv preprint arXiv:1501.05046},
year = {2015}
}