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újo and Cameron about synchronising groups.
Original language | English |
---|---|
Pages (from-to) | 235-241 |
Number of pages | 7 |
Journal | European Journal of Combinatorics |
Volume | 61 |
DOIs | |
Publication status | Published - 1 Mar 2017 |