Balanced bipartite weighing designs
โ Scribed by Charlotte Huang
- Publisher
- Elsevier Science
- Year
- 1976
- Tongue
- English
- Weight
- 851 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We determine here those quadruples (a, b, c, d) of positive integers for which the edges of the complete bipartite graph K c , d can be partitioned into copies of K n , b . ## 1. Introduction A classic problem in design theory is to partition the edges of the complete graph on v vertices ( K , ) i
Algebraic techniques are employed to obtain necessary conditions for the existence of certain families of circulant weighing designs. As an application we rule out the existence of many circulant weighing designs. In particular, we show that there does not exist a circulant weighing matrix of order