Primitive decompositions of Johnson graphs

Authors:
Alice Devillers;Michael Giudici;Cai Heng Li;Cheryl E. Praeger
Affiliations:
Université Libre de Bruxelles, Département de Mathématiques, Géométrie, CP 216, Boulevard du Triomphe, B-1050 Brussels, Belgium;School of Mathematics and Statistics, The University of Western Australia, 35 Stirling Highway, Crawley, WA 6009, Australia;School of Mathematics and Statistics, The University of Western Australia, 35 Stirling Highway, Crawley, WA 6009, Australia;School of Mathematics and Statistics, The University of Western Australia, 35 Stirling Highway, Crawley, WA 6009, Australia
Venue:
Journal of Combinatorial Theory Series A
Year:
2008

Citing 5
Cited 2

The MAGMA algebra system I: the user language

Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Computing Isotypic Projections with the Lanczos Iteration

SIAM Journal on Matrix Analysis and Applications
On classifying finite edge colored graphs with two transitive automorphism groups

Journal of Combinatorial Theory Series B
Homogeneous factorisations of graphs and digraphs

European Journal of Combinatorics
Homogeneous factorisations of Johnson graphs

Designs, Codes and Cryptography

Some graphs related to the small Mathieu groups

European Journal of Combinatorics
The Automorphism Group of a Johnson Graph

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.00

Visualization

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.