Sciweavers

DM
2008
75views more  DM 2008»
13 years 11 months ago
Homogeneous factorisations of graph products
A homogeneous factorisation of a digraph consists of a partition P = {P1, . . . , Pk} of the arc set A and two vertex-transitive subgroups M G Aut() such that M fixes each Pi set...
Michael Giudici, Cai Heng Li, Primoz Potocnik, Che...