The Existence of 32‐DSS (4,6)‐GDDs of Type gu
ABSTRACT A design is said to be super‐simple if any two of its blocks have at most two common points. A design with index is said to be ‐ decomposable , if its blocks can be partitioned into nonempty collections , such that each with the point set forms a design with index . In this paper, it is proved that there exists a ‐DSS ‐GDD (decomposable super‐simple group divisible design) of type if and only if and , and except possibly for .
Authors
- R. Julian R. Abel (ORCID: https://orcid.org/0000-0002-3632-9612)
- Dianhua Wu (ORCID: https://orcid.org/0000-0002-2966-0606)
- Huangsheng Yu (ORCID: https://orcid.org/0000-0001-9388-6186)
- Jingyuan Chen (ORCID: https://orcid.org/0000-0001-8017-3670)
Institutions
- Guangxi Normal University (CN)
- UNSW Sydney (AU)
Publication Details
- Journal
- Journal of Combinatorial Designs
- Published
- 2026-07-23
- DOI
- https://doi.org/10.1002/jcd.70027
- Primary Topic
- graph theory and CDMA systems
- Type
- article
- Field-Weighted Citation Impact
- 0.00