TY - JOUR
T1 - Homogeneous factorisations of Johnson graphs
AU - Cuaresma, M.C.
AU - Giudici, Michael
AU - Praeger, Cheryl
PY - 2008
Y1 - 2008
N2 - For a graph Γ, subgroups M <G \leqslant Aut(G)Unknown control sequence '\leqslant' , and an edge partition E of Γ, the pair (G, E)() is a (G, M)-homogeneous factorisation if M is vertex-transitive on Γ and fixes setwise each part of E , while G permutes the parts of E transitively. A classification is given of all homogeneous factorisations of finite Johnson graphs. There are three infinite families and nine sporadic examples.
AB - For a graph Γ, subgroups M <G \leqslant Aut(G)Unknown control sequence '\leqslant' , and an edge partition E of Γ, the pair (G, E)() is a (G, M)-homogeneous factorisation if M is vertex-transitive on Γ and fixes setwise each part of E , while G permutes the parts of E transitively. A classification is given of all homogeneous factorisations of finite Johnson graphs. There are three infinite families and nine sporadic examples.
U2 - 10.1007/s10623-007-9158-2
DO - 10.1007/s10623-007-9158-2
M3 - Article
SN - 0925-1022
VL - 46
SP - 303
EP - 327
JO - Designs Codes and Cryptography
JF - Designs Codes and Cryptography
IS - 3
ER -