A characterization of the graphs of bilinear (d d)-forms over F₂

DOI10.1007/S00493-017-3573-4MaRDI QIDQ2322503zbMATH OpenOpenAlexFDO

Authors Alexander L. Gavrilyuk, Jack H. Koolen

Publication date 4 September 2019

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1511.09435

zbMATH Keywords

bilinear formsdistance-regular graphsfinite fieldsintersection array

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Association schemes, strongly regular graphs (05E30) Combinatorial structures in finite projective spaces (51E20)

Abstract: The bilinear forms graph denoted here by $Bi{l}_q(eimesd)$ is a graph defined on the set of $(eimesd)$-matrices ($egeqd$) over $mathbb{F}_q$ with two matrices being adjacent if and only if the rank of their difference equals $1$. In 1999, K. Metsch showed that the bilinear forms graph $Bi{l}_q(eimesd)$ is characterized by its intersection array if one of the following holds: (-) $q=2$ and $egeqd+4$, (-) $qgeq3$ and $egeqd+3$. Thus, the following cases have been left unsettled: (-) $q=2$ and $eind,d+1,d+2,d+3$, (-) $qgeq3$ and $eind,d+1,d+2$. In this work, we show that the graph of bilinear $(dimesd)$-forms over the binary field, where $dgeq3$, is characterized by its intersection array. In doing so, we also classify locally grid graphs whose $mu$-graphs are hexagons and the intersection numbers $b_i,c_i$ are well-defined for all $i=0,1,2$.

Review text

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\).

Recommendations

• On a characterization of bilinear forms graphs
• A bilinear form relating two Leonard systems
• A unified approach to a characterization of Grassmann graphs and bilinear forms graphs
• The spectrum of the second subconstituent of the bilinear forms graph \(H_q(d,e)\)
• Bilinear forms graphs over residue class rings

Cited in

(21)

• A characterization of the association schemes of bilinear forms
• Two remarks on Huang's characterization of the bilinear forms graphs
• The spectrum of the second subconstituent of the bilinear forms graph \(H_q(d,e)\)
• On a characterization of bilinear forms graphs
• A unified approach to a characterization of Grassmann graphs and bilinear forms graphs
• On some recent progress in the classification of (\(P\) and \(Q\))-polynomial association schemes
• Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
• Three infinite families of Shilla graphs do not exist
• Bilinear forms graphs over residue class rings
• scientific article; zbMATH DE number 493054 (Why is no real title available?)
• scientific article; zbMATH DE number 797034 (Why is no real title available?)
• On Q-Polynomial Shilla Graphs with b=6
• SHILLA GRAPHS WITH \(b=5\) AND \(b=6\)
• On nonexistence of distance regular graphs with the intersection array ${53,40,28,16;1,4,10,28}$
• On few-class \(Q\)-polynomial association schemes: feasible parameters and nonexistence results
• On distance-regular graphs \(\Gamma\) of diameter 3 for which \(\Gamma_3\) is a triangle-free graph
• On Q -polynomial Shilla graphs with b=6
• Using a Grassmann graph to recover the underlying projective geometry
• A characterization of the Grassmann graphs
• Bounding the parameter of a distance-regular graph with classical parameters
• A bilinear form relating two Leonard systems

This page was built for publication: A characterization of the graphs of bilinear \((d\times d)\)-forms over \(\mathbb{F}_2\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2322503)