Using a Grassmann graph to recover the underlying projective geometry

DOI10.1007/S00373-024-02816-2zbMATH Open1546.05148MaRDI QIDQ6598011

Ian Seong

Publication date: 4 September 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

distance-regular graphprojective geometryGrassmann graphEuclidean representation

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12) Combinatorial structures in finite projective spaces (51E20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Krawtchouk polynomials, the Lie algebra \(\mathfrak{sl}_2\), and Leonard pairs
• The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)
• A characterization of the association schemes of bilinear forms
• Characterization of H(n,q) by the parameters
• Characterization of the odd graphs \(O_ k \)by parameters
• A characterization of the association schemes of Hermitian forms
• Two remarks on Huang's characterization of the bilinear forms graphs
• On a characterization of bilinear forms graphs
• A new inequality for distance-regular graphs
• Kite-free distance-regular graphs
• A characterization of Grassmann graphs
• A characterization of the graphs of bilinear \((d\times d)\)-forms over \(\mathbb{F}_2\)
• A new family of distance-regular graphs with unbounded diameter

This page was built for publication: Using a Grassmann graph to recover the underlying projective geometry

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