Skip to content

Neumaier graphs of coherent rank five

Gary Greaves, Zhao Kuang Tan

math.COarXiv:2609.02218

Abstract

We construct an infinite family of Neumaier graphs of coherent rank five, answering the existence question at the smallest possible coherent rank beyond the strongly regular case. For every prime power q≥slant7 with q34, set n=q+1. Each graph in our construction has precisely five distinct eigenvalues, Neumaier parameters \[ ( n(n-1)(n-3), n2(n-3)2, n(n2-n-8)4; (n-2)22, (n-1)(n-3) ), \] and its adjacency matrix lies in the Bose--Mesner algebra of the four-class association scheme of Holzmann, Kharaghani, and Suda. Paley Hadamard matrices and Desarguesian mutually orthogonal Latin squares yield an infinite family whose smallest member has parameters (280,160,96;18,35).

Create a lesson