Constructing Homogeneous Factorisations of Complete Graphs and Digraphs |
| |
| Authors: | Cai Heng Li Cheryl E Praeger |
| |
| Institution: | (1) School of Mathematics and Statistics, University of Western Australia, Crawley, Western Australia 6009, Australia. e-mail: li@maths.uwa.edu.au, AU;(2) School of Mathematics and Statistics, University of Western Australia, Crawley, Western Australia 6009, Australia. e-mail: praeger@maths.uwa.edu.au, AU |
| |
| Abstract: | A homogeneous factorisation of a complete graph K
n
is a partition of the edge set that is invariant under a subgroup G of S
n
such that G is transitive on the parts of the partition and induces a vertex-transitive automorphism group on the graph corresponding
to each part. A product construction is given for such factorisations.
Received: October, 2001 Final version received: May 17, 2002 |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
