Article ID Journal Published Year Pages File Type
8903667 European Journal of Combinatorics 2017 7 Pages PDF
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.
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Vertex-primitive digraphs having vertices with almost equal neighbourhoods
Authors
, ,