Construction of divisible design graphs using affine designs
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866915157680062464 |
|---|---|
| author | Kabanov, Vladislav V. |
| author_facet | Kabanov, Vladislav V. |
| contents | A $k$-regular graph on $v$ vertices is a {\em divisible design graph} if there exist integers $λ_1,λ_2,m,n$ such that the vertex set can be partitioned into $m$ classes of size $n$ and any two different vertices from the same class have $λ_1$ common neighbours, and any two vertices from different classes have $λ_2$ common neighbours. In this paper, a new construction that produces divisible design graphs is provided. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_12503 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Construction of divisible design graphs using affine designs Kabanov, Vladislav V. Combinatorics 05C50, 05E30 F.2.2 A $k$-regular graph on $v$ vertices is a {\em divisible design graph} if there exist integers $λ_1,λ_2,m,n$ such that the vertex set can be partitioned into $m$ classes of size $n$ and any two different vertices from the same class have $λ_1$ common neighbours, and any two vertices from different classes have $λ_2$ common neighbours. In this paper, a new construction that produces divisible design graphs is provided. |
| title | Construction of divisible design graphs using affine designs |
| topic | Combinatorics 05C50, 05E30 F.2.2 |
| url | https://arxiv.org/abs/2502.12503 |