Rank 3 Transitive Decompositions of Complete Multipartite Graphs

Geoffrey Pearce, Cheryl Praeger

    Research output: Contribution to journalArticlepeer-review

    2 Citations (Scopus)


    A transitive decomposition of a graph is a partition of the edge or arc set giving a set of subgraphs which are preserved and permuted transitively by a group of automorphisms of the graph. This paper deals with transitive decompositions of complete multipartite graphs preserved by an imprimitive rank 3 permutation group. We obtain a near-complete classification of these when the group in question has an almost simple component. © 2011 Springer.
    Original languageEnglish
    Pages (from-to)669-680
    JournalGraphs and Combinatorics
    Issue number3
    Publication statusPublished - 2013


    Dive into the research topics of 'Rank 3 Transitive Decompositions of Complete Multipartite Graphs'. Together they form a unique fingerprint.

    Cite this