Saved in:
Bibliographic Details
Main Authors: Jin, Wei, Koolen, Jack H., Lv, Chenhui
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2605.25754
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866918521443713024
author Jin, Wei
Koolen, Jack H.
Lv, Chenhui
author_facet Jin, Wei
Koolen, Jack H.
Lv, Chenhui
contents In this paper, we classify connected amply regular graphs with diameter $d \geq 4$ and parameters $(v, k, λ, μ)$ satisfying $μ= \frac{k-1}{2}$, where $k\geq 5$ is odd. We prove that such a graph must be exactly one of the following: the $5$-cube, the graph $\K_2 \square Λ$, where $Λ$ is the unique bipartite $(0,2)$-graph on $14$ vertices, or the point--block incidence graph of a group divisible design with the dual property, namely a $GDDDP\left(2, k+1;\, k;\, 0, \frac{k-1}{2}\right)$. For the last family, we give equivalent characterizations in terms of bipartite $Q$-regular graphs and relation graphs of symmetric association schemes with five classes. Furthermore, we present constructions of such amply regular graphs, yielding infinite families of examples derived from Paley graphs, Peisert graphs, and Paley digraphs.
format Preprint
id arxiv_https___arxiv_org_abs_2605_25754
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Amply regular graphs with $μ$ close to half the valency and group divisible designs
Jin, Wei
Koolen, Jack H.
Lv, Chenhui
Combinatorics
In this paper, we classify connected amply regular graphs with diameter $d \geq 4$ and parameters $(v, k, λ, μ)$ satisfying $μ= \frac{k-1}{2}$, where $k\geq 5$ is odd. We prove that such a graph must be exactly one of the following: the $5$-cube, the graph $\K_2 \square Λ$, where $Λ$ is the unique bipartite $(0,2)$-graph on $14$ vertices, or the point--block incidence graph of a group divisible design with the dual property, namely a $GDDDP\left(2, k+1;\, k;\, 0, \frac{k-1}{2}\right)$. For the last family, we give equivalent characterizations in terms of bipartite $Q$-regular graphs and relation graphs of symmetric association schemes with five classes. Furthermore, we present constructions of such amply regular graphs, yielding infinite families of examples derived from Paley graphs, Peisert graphs, and Paley digraphs.
title Amply regular graphs with $μ$ close to half the valency and group divisible designs
topic Combinatorics
url https://arxiv.org/abs/2605.25754