On a characterization of bilinear forms graphs

DOI10.1006/EUJC.1998.0280zbMATH Open0923.05050OpenAlexW2064778104MaRDI QIDQ1294062FDOQ1294062

Klaus Metsch

Publication date: 15 September 1999

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.1998.0280

Recommendations

• A unified approach to a characterization of Grassmann graphs and bilinear forms graphs
• A characterization of the association schemes of bilinear forms
• A characterization of the graphs of bilinear \((d\times d)\)-forms over \(\mathbb{F}_2\)
• Two remarks on Huang's characterization of the bilinear forms graphs

zbMATH Keywords

distance regular graphsclassical parametersbilinear forms graphs

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Structural characterization of families of graphs (05C75)

Cited In (19)

• Diameter bounds for geometric distance-regular graphs
• On the nonexistence of pseudo-generalized quadrangles
• On distance-regular graphs with smallest eigenvalue at least \(- m\)
• Geometric aspects of 2-walk-regular graphs
• The bilinear–biquadratic model on the complete graph
• Title not available (Why is that?)
• Spectral properties of Cayley graphs over \(M_{m \times n}(F_q)\)
• Using a Grassmann graph to recover the underlying projective geometry
• Asymptotic Delsarte cliques in distance-regular graphs
• The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters
• 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
• Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs
• On the automorphism groups of strongly regular graphs. II.
• A characterization of the association schemes of bilinear forms
• Two remarks on Huang's characterization of the bilinear forms graphs
• Matrix graphs and MRD codes over finite principal ideal rings
• Restrictions on classical distance-regular graphs
• Thin \(Q\)-polynomial distance-regular graphs have bounded \(c_2\)

This page was built for publication: On a characterization of bilinear forms graphs

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