Vertexprimitive digraphs having vertices with almost equal neighbourhoods
Abstract
We consider vertexprimitive 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újo and Cameron about synchronising groups.
 Publication:

arXiv eprints
 Pub Date:
 January 2015
 DOI:
 10.48550/arXiv.1501.05046
 arXiv:
 arXiv:1501.05046
 Bibcode:
 2015arXiv150105046S
 Keywords:

 Mathematics  Combinatorics;
 Mathematics  Group Theory