A characterization of the association schemes of bilinear forms

DOI10.1016/S0195-6698(87)80007-0zbMath0675.05064MaRDI QIDQ1121921

Tayuan Huang

Publication date: 1987

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

zbMATH Keywords

distance-regular graphsinduced subgraphantipodal covering

Mathematics Subject Classification ID

Paths and cycles (05C38) Other designs, configurations (05B30) Graph theory (05C99)

Related Items

Spectral properties of Cayley graphs over \(M_{m \times n}(F_q)\), On distance-regular graphs with smallest eigenvalue at least \(- m\), A characterization of Grassmann and attenuated spaces as \((0,\alpha)\)-geometries., A \(Q\)-polynomial structure for the attenuated space poset \(\mathcal{A}_q (N, M)\), Matrix graphs and MRD codes over finite principal ideal rings, Two remarks on Huang's characterization of the bilinear forms graphs, \((s,r;\mu )\)-nets and alternating forms graphs, The subconstituent algebra of an association scheme. I, On distance transitive graphs whose automorphism groups are affine, On some recent progress in the classification of (\(P\) and \(Q\))-polynomial association schemes, Affine attenuated spaces, Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I, Pooling spaces and non-adaptive pooling designs, Association schemes based on attenuated spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)
• Characterization of H(n,q) by the parameters
• Dual polar spaces
• Incidence structures whose planes are nets
• Characterization of projective graphs
• Bilinear forms over a finite field, with applications to coding theory
• On the uniqueness of the graphs G(n,k) of the Johnson schemes
• Une caractérisation des espaces affins basée sur la notion de droite
• Antipodal covering graphs
• A characterization of tetrahedral graphs
• A characterization of cubic lattice graphs
• A characterization of the Tm graph