Near-Compatible Factorization
A compatible factorization of order v, is a v × (v−1)2 array of distinct triples in which row i form a near-one-factor with focus i. This article aims to develop compatible factorization to display v×( v−1 2 −2 3 ) triples with minimum repetition. Through this article, we propose and define a new ty...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Academic Publications, Ltd.
2018
|
| Subjects: | |
| Online Access: | https://repo.uum.edu.my/id/eprint/30782/1/IJPAM%20120%2002%20259-273.pdf |