Homogeneous factorisations of Johnson graphs

Creator

Maria Cristeta Cuaresma, University of the Philippines Los Banos
Michael Giudici, The University of Western Australia
Cheryl E. Praeger, The University of Western Australia

Issue Date

3-2008

Abstract

For a graph Γ, subgroups M < G ≤ Aut(Γ), and an edge partition ε of Γ, the pair (Γ ε)is a (G, M)-homogeneous factorisation if M is vertex-transitive on Γ and fixes setwise each part of ε , while G permutes the parts of ε transitively. A classification is given of all homogeneous factorisations of finite Johnson graphs. There are three infinite families and nine sporadic examples. © 2007 Springer Science+Business Media, LLC.

Source or Periodical Title

Designs, Codes, and Cryptography

ISSN

9251022

Volume

46

Issue

3

Page

303-327

Document Type

Article

College

College of Arts and Sciences (CAS)

Language

English

Subject

Homogeneous factorisations, Johnson graphs

Recommended Citation

Cuaresma, Maria Cristeta & Giudici, Michael & Praeger, Cheryl. (2008). Homogeneous factorisations of Johnson graphs. Des. Codes Cryptography. 46. 303-327.

Identifier

https://doi.org/10.1007/s10623-007-9158-2

Digital Copy

YES