4 search results - page 1 / 1 » Homogeneous factorisations of graphs and digraphs |
DM
2008
14 years 10 months ago
2008
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...
65
Voted
EJC
2006
14 years 10 months ago
2006
DCC
2008
IEEE
15 years 10 months ago
2008
IEEE
For a graph , subgroups M < G Aut(), and an edge partition E of , the pair (, E) is a (G, M)-homogeneous factorisation if M is vertex-transitive on and fixes setwise each part...
DM
2007
14 years 10 months ago
2007