Rank 3 Transitive Decompositions of Complete Multipartite Graphs

Geoffrey Pearce; Cheryl Praeger

doi:10.1007/s00373-011-1120-4

Rank 3 Transitive Decompositions of Complete Multipartite Graphs

Geoffrey Pearce
, Cheryl Praeger

Research output: Contribution to journal › Article › peer-review

3 Citations (Scopus)

Abstract

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 language	English
Pages (from-to)	669-680
Journal	Graphs and Combinatorics
Volume	29
Issue number	3
DOIs	https://doi.org/10.1007/s00373-011-1120-4
Publication status	Published - 2013

Access to Document

10.1007/s00373-011-1120-4

Cite this

@article{cd2cdf90cb61452fbf732b943eae52c0,

title = "Rank 3 Transitive Decompositions of Complete Multipartite Graphs",

abstract = "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. {\textcopyright} 2011 Springer.",

author = "Geoffrey Pearce and Cheryl Praeger",

year = "2013",

doi = "10.1007/s00373-011-1120-4",

language = "English",

volume = "29",

pages = "669--680",

journal = "Graphs and Combinatorics",

issn = "0911-0119",

publisher = "Springer",

number = "3",

}

TY - JOUR

T1 - Rank 3 Transitive Decompositions of Complete Multipartite Graphs

AU - Pearce, Geoffrey

AU - Praeger, Cheryl

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

U2 - 10.1007/s00373-011-1120-4

DO - 10.1007/s00373-011-1120-4

M3 - Article

SN - 0911-0119

VL - 29

SP - 669

EP - 680

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 3

ER -

Rank 3 Transitive Decompositions of Complete Multipartite Graphs

Abstract

Access to Document

Fingerprint

Cite this