| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656400 | Journal of Combinatorial Theory, Series A | 2008 | 42 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
