Minimal harmoniously colorable designs
β Scribed by L. R. A. Casse; Christine M. O'Keefe; B. J. Wilson
- Book ID
- 102310050
- Publisher
- John Wiley and Sons
- Year
- 1994
- Tongue
- English
- Weight
- 460 KB
- Volume
- 2
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
β¦ Synopsis
A graph G is minimal harmoniously colorable if it has a proper vertex coloring in which each pair of colors occurs exactly once on a n edge. In particular, if D is a 2-design we consider the graph G whose vertices are the points and blocks of D and where two vertices of G are adjacent if and only if the corresponding elements of D are incident. It will be shown that if D is symmetric then G is minimal harmoniously colorable if and only if D is a Hadamard design with corresponding Hadamard matrix of a certain form. We obtain some results if D is nonsymmetric, and construct two classes of nonsymmetric minimal harmoniously colorable designs.
π SIMILAR VOLUMES
A color selection method that considers subjective principles is becoming more and more necessary in a computer-based color management system. However, one from an engineering perspective has received limited attention. Previously, we developed an approach to measure the degree of color harmony by t
## Abstract An __S__(2, 4, __v__) design has a type B Οβcoloring if it is possible to assign one of Ο colors to each point such that each block contains three points of one color and one point of a different color, and all Ο colors are used. In this article we describe the constructions of type B Ο