A characterization of the graphs of bilinear \((d\times d)\)-forms over \(\mathbb{F}_2\) (Q2322503)

The bilinear forms graph \(\text{Bil}_q(d\times e)\) is a graph defined on the set of \((d\times e)\)-matrices \((e\geq d)\) over the finite field \(F_q\) with two matrices being adjacent if and only if the rank of their difference equals one. \textit{K. Metsch} [Eur. J. Comb. 20, No. 4, 293--306 (1999; Zbl 0923.05050)] showed that the bilinear forms graph with \(d\geq 3\) is uniquely determined as a distance-regular graph by its intersection array unless \(q=2\), \(e\in\{d,d+1,d+2,d+3\}\) or \(q\geq 3\), \(e\in\{d,d+1,d+2\}\). Here, the authors exploit Q-polynomiality of the bilinear forms graph to settle one of the remaining cases: \(q=2\) and \(e=d\geq 3\).