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

From MaRDI portal
Publication:2322503

DOI10.1007/S00493-017-3573-4zbMATH Open1438.05241arXiv1511.09435OpenAlexW2953532090MaRDI QIDQ2322503FDOQ2322503


Authors: Alexander L. Gavrilyuk, Jack H. Koolen Edit this on Wikidata


Publication date: 4 September 2019

Published in: Combinatorica (Search for Journal in Brave)

Abstract: The bilinear forms graph denoted here by Bilq(eimesd) is a graph defined on the set of (eimesd)-matrices (egeqd) over mathbbFq 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 Bilq(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 bi,ci are well-defined for all i=0,1,2.


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




Recommendations





Cited In (17)





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)