Divisible design graphs from Higmanian association schemes
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918305458028544 |
|---|---|
| author | Ryabov, Grigory |
| author_facet | Ryabov, Grigory |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_18370 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Divisible design graphs from Higmanian association schemes Ryabov, Grigory Combinatorics 05B05, 05C60, 05E30 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. |
| title | Divisible design graphs from Higmanian association schemes |
| topic | Combinatorics 05B05, 05C60, 05E30 |
| url | https://arxiv.org/abs/2601.18370 |