A characterization of the graphs of bilinear (d d)-forms over F₂
From MaRDI portal
Publication:2322503
Abstract: The bilinear forms graph denoted here by is a graph defined on the set of -matrices () over with two matrices being adjacent if and only if the rank of their difference equals . In 1999, K. Metsch showed that the bilinear forms graph is characterized by its intersection array if one of the following holds: (-) and , (-) and . Thus, the following cases have been left unsettled: (-) and , (-) and . In this work, we show that the graph of bilinear -forms over the binary field, where , is characterized by its intersection array. In doing so, we also classify locally grid graphs whose -graphs are hexagons and the intersection numbers are well-defined for all .
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
(17)- On \(Q \)-polynomial Shilla graphs with \(b=6 \)
- scientific article; zbMATH DE number 797034 (Why is no real title available?)
- Bilinear forms graphs over residue class rings
- Using a Grassmann graph to recover the underlying projective geometry
- scientific article; zbMATH DE number 493054 (Why is no real title available?)
- Three infinite families of Shilla graphs do not exist
- 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
- A characterization of the association schemes of bilinear forms
- Two remarks on Huang's characterization of the bilinear forms graphs
- On nonexistence of distance regular graphs with the intersection array ${53,40,28,16;1,4,10,28}$
- On Q-Polynomial Shilla Graphs with b=6
- SHILLA GRAPHS WITH \(b=5\) AND \(b=6\)
- A characterization of the Grassmann graphs
- A bilinear form relating two Leonard systems
- 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
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)