Vertex-primitive digraphs having vertices with almost equal neighbourhoods

Pablo Spiga, Gabriel Verret

    Research output: Contribution to journalArticle

    1 Citation (Scopus)

    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 languageEnglish
    Pages (from-to)235-241
    Number of pages7
    JournalEuropean Journal of Combinatorics
    Volume61
    DOIs
    Publication statusPublished - 1 Mar 2017

    Fingerprint Dive into the research topics of 'Vertex-primitive digraphs having vertices with almost equal neighbourhoods'. Together they form a unique fingerprint.

    Cite this