Primitive decompositions of Johnson graphs
Combinatorics
2007-12-12 v1
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.
Keywords
Cite
@article{arxiv.0712.1622,
title = {Primitive decompositions of Johnson graphs},
author = {Alice Devillers and Michael Giudici and Cai Heng Li and Cheryl E. Praeger},
journal= {arXiv preprint arXiv:0712.1622},
year = {2007}
}
Comments
35 pages