Papers
Topics
Authors
Recent
Search
2000 character limit reached

Neumaier graphs of coherent rank five

Published 2 Sep 2026 in math.CO | (2609.02218v1)

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⩾7q\geqslant7 with q≡3(mod4)q\equiv3\pmod4, set n=q+1n=q+1. Each graph in our construction has precisely five distinct eigenvalues, Neumaier parameters [ \left( n(n-1)(n-3), \frac{n2(n-3)}2, \frac{n(n2-n-8)}4; \frac{(n-2)2}{2}, (n-1)(n-3) \right), ] 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)(280,160,96;18,35).

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.