Back to Search
Start Over
Resolvable 4-cycle group divisible designs with two associate classes: Part size even
- Source :
-
Discrete Mathematics . Feb2008, Vol. 308 Issue 2/3, p303-307. 5p. - Publication Year :
- 2008
-
Abstract
- Abstract: Let denote the graph on a vertices with edges between every pair of vertices. Take p copies of this graph , and join each pair of vertices in different copies with edges. The resulting graph is denoted by , a graph that was of particular interest to Bose and Shimamoto in their study of group divisible designs with two associate classes. The existence of z-cycle decompositions of this graph have been found when . In this paper we consider resolvable decompositions, finding necessary and sufficient conditions for a 4-cycle factorization of (when is even) or of minus a 1-factor (when is odd) whenever a is even. [Copyright &y& Elsevier]
- Subjects :
- *GRAPHIC methods
*GEOMETRICAL drawing
*MATHEMATICS
*GEOMETRY
Subjects
Details
- Language :
- English
- ISSN :
- 0012365X
- Volume :
- 308
- Issue :
- 2/3
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 27703199
- Full Text :
- https://doi.org/10.1016/j.disc.2006.11.043