Primitive decompositions of Johnson graphs

Michael Giudici; Cheryl Praeger; Alice Devillers; Cai-Heng Li

doi:10.1016/j.jcta.2007.11.005

Primitive decompositions of Johnson graphs

Michael Giudici, Cheryl Praeger, Alice Devillers, Cai-Heng Li

Graduate Research School

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

4 Citations (Scopus)

175 Downloads (Pure)

Abstract

A transitive decomposition of a graph is a partition of the edge set together with a group of automorphisms which transitively permutes the parts. In this paper we determine all transitive decompositions of the Johnson graphs such that the group preserving the partition is arc-transitive and acts primitively on the parts.

Original language	English
Pages (from-to)	925-966
Journal	Journal of Combinatorial Theory Series A
Volume	115
Issue number	6
DOIs	https://doi.org/10.1016/j.jcta.2007.11.005
Publication status	Published - 2008

Access to Document

10.1016/j.jcta.2007.11.005

Download full text
Post print of work supplied Link to Publisher's website supplied in Alternative Location.

Cite this

@article{b531aefa8507489fa6e3d79e0693b777,

title = "Primitive decompositions of Johnson graphs",

abstract = "A transitive decomposition of a graph is a partition of the edge set together with a group of automorphisms which transitively permutes the parts. In this paper we determine all transitive decompositions of the Johnson graphs such that the group preserving the partition is arc-transitive and acts primitively on the parts.",

author = "Michael Giudici and Cheryl Praeger and Alice Devillers and Cai-Heng Li",

year = "2008",

doi = "10.1016/j.jcta.2007.11.005",

language = "English",

volume = "115",

pages = "925--966",

journal = "Journal of Combinatorial Theory Series A",

issn = "0021-9800",

publisher = "Academic Press",

number = "6",

}

TY - JOUR

T1 - Primitive decompositions of Johnson graphs

AU - Giudici, Michael

AU - Praeger, Cheryl

AU - Devillers, Alice

AU - Li, Cai-Heng

PY - 2008

Y1 - 2008

N2 - A transitive decomposition of a graph is a partition of the edge set together with a group of automorphisms which transitively permutes the parts. In this paper we determine all transitive decompositions of the Johnson graphs such that the group preserving the partition is arc-transitive and acts primitively on the parts.

AB - A transitive decomposition of a graph is a partition of the edge set together with a group of automorphisms which transitively permutes the parts. In this paper we determine all transitive decompositions of the Johnson graphs such that the group preserving the partition is arc-transitive and acts primitively on the parts.

U2 - 10.1016/j.jcta.2007.11.005

DO - 10.1016/j.jcta.2007.11.005

M3 - Article

SN - 0021-9800

VL - 115

SP - 925

EP - 966

JO - Journal of Combinatorial Theory Series A

JF - Journal of Combinatorial Theory Series A

IS - 6

ER -

Primitive decompositions of Johnson graphs

Abstract

Access to Document

Fingerprint

Cite this