Title of article
Resolvable gregarious cycle decompositions of complete equipartite graphs Original Research Article
Author/Authors
Elizabeth J. Billington، نويسنده , , D.G. Hoffman، نويسنده , , C.A. Rodger، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
10
From page
2844
To page
2853
Abstract
The complete multipartite graph image with n parts of size m is shown to have a decomposition into n-cycles in such a way that each cycle meets each part of image; that is, each cycle is said to be gregarious. Furthermore, gregarious decompositions are given which are also resolvable.
Keywords
Resolvable decomposition , Complete multipartite graph , Gregarious cycle decomposition
Journal title
Discrete Mathematics
Serial Year
2008
Journal title
Discrete Mathematics
Record number
947384
Link To Document