Divisible design graphs from Higmanian association schemes Full article
| Journal |
Designs, Codes and Cryptography
ISSN: 0925-1022 , E-ISSN: 1573-7586 |
||||||
|---|---|---|---|---|---|---|---|
| Output data | Year: 2026, Volume: 94, Article number : 221, Pages count : 22 DOI: 10.1007/s10623-026-01973-0 | ||||||
| Tags | Divisible design graphs, Association schemes, Difference sets | ||||||
| Authors |
|
||||||
| Affiliations |
|
Funding (1)
| 1 | Министерство науки и высшего образования РФ | FWNF-2026-0011 |
Abstract:
An imprimitive symmetric indecomposable association scheme of rank 5 is said to be Higmanian.A divisible design graph is a graph whose adjacency matrix is an incidence matrix of a symmetric divisible design. We establish conditions which guarantee that a union of some basis relations of a Higmanian association scheme is an edge set of a divisible design graph. Further, we show that several known families of divisible design graphs can be obtained as fusions of Higmanian association schemes. Finally, using our approach we construct new infinite families of divisible design graphs.
Cite:
Ryabov G.
Divisible design graphs from Higmanian association schemes
Designs, Codes and Cryptography. 2026. V.94. 221 :1-22. DOI: 10.1007/s10623-026-01973-0 WOS Scopus OpenAlex
Divisible design graphs from Higmanian association schemes
Designs, Codes and Cryptography. 2026. V.94. 221 :1-22. DOI: 10.1007/s10623-026-01973-0 WOS Scopus OpenAlex
Dates:
| Submitted: | Jan 26, 2026 |
| Accepted: | Oct 20, 2026 |
| Published print: | Nov 10, 2026 |
| Published online: | Nov 10, 2026 |
Identifiers:
| ≡ Web of science: | WOS:001926736200004 |
| ≡ Scopus: | 2-s2.0-105056148234 |
| ≡ OpenAlex: | W7125780537 |