Skip to content
Preprint

Neumaier graphs of coherent rank five

Sep 2026 · 1 citation · 19 references
Mathematics

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\geqslant7$ with $q\equiv3\pmod4$, set $n=q+1$. Each graph in our construction has precisely five distinct eigenvalues, Neumaier parameters \[ \left( n(n-1)(n-3), \frac{n^2(n-3)}2, \frac{n(n^2-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)$.

View source

Similar papers

Preprint Aug 2026

Rank-Three Projections and Minimal Multiplicity Bipartitions of Path Complements

For a graph \(G\) admitting a real symmetric realization with exactly two distinct eigenvalues, \(MB(G)\) is the minimum, over all such realizations, of the smaller of the two eigenvalue multiplicities. Adm, Fallat, Meagher, Nasserasr, Plosker, and Yang asked for this parameter for the complement of a path on at least...

Jin-Tao Fei, Jianglong Luo · 0 citations
Preprint Oct 2026

The Genus of Bipartite Kneser Graphs

We determine the orientable genus of an infinite family of bipartite Kneser graphs. The graph $H(h,2)$ has two copies of the two-element subsets of $[h]$, with opposite-class vertices adjacent when the corresponding subsets are disjoint. For every prime $h>3$ with $h\equiv3\pmod8$, we prove $$ \gamma(H(h,2))=1-\frac{h(...

Austin Ulrigg, Alexander Metzger · 1 citation
Preprint Sep 2026

Recursive-Line Zarankiewicz Numbers with Four Columns

The recursive-line Zarankiewicz number maximizes the number of squares in a structured irreducible sum-of-squares representation encoded by an augmentation of an extremal $C_4$-free bipartite graph. We determine its four-column behavior under the strengthened recursive definition in the manuscript of L\"ofberg and Qi d...

Zhi-Wei Chen, Yan-Nan Chen · 6 citations · ⚡2
Preprint Sep 2026

Exact Second-Order Zarankiewicz Numbers for Complete-Graph Incidence Families

For $n\ge6$, $m=\binom n2$, let the complete-graph incidence family on $K_n$ have the vertices of $K_n$ as columns, its edges as rows, and the incidence graph as one-edge graph. The universal cell bound of L\"ofberg and Qi gives $z_2(m,n)\le Z(n):=\lfloor n(n-1)(n+2)/4\rfloor$. We implement the nested one-factorization...

Yan-Nan Chen, J. Löfberg, Li-Qun Qi · 3 citations · ⚡1
Preprint Sep 2026

Annihilating-Ideal Graphs and Orthogonality Graphs over $\mathbb{F}_2$

We construct a family of finite local rings whose annihilating-ideal graphs are naturally described by orthogonality of subspaces of $\mathbb{F}_2^n$. For $n=4$ we determine the clique and chromatic numbers exactly and obtain \[ \omega(\AG(R_4))=5<6=\chi(\AG(R_4)). \] Thus $\AG(R_4)$ is not weakly perfect, and the Behb...

R. Nikandish · 0 citations
Preprint Sep 2026

Spectral bipartiteness in generalized odd graphs of diameter three

For a graph $G$ of order $n$, put $\sigma(G)=(\lambda_1(G)+\lambda_n(G))/n$. We determine the first three largest values of this invariant among nonbipartite distance-regular graphs of diameter three and odd girth at least seven. The unique maximizer is the folded $7$-cube, with value $1/32$; the unique second maximize...

Qi Zhou · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.