On a characterization of bilinear forms graphs

DOI10.1006/eujc.1998.0280zbMath0923.05050OpenAlexW2064778104MaRDI QIDQ1294062

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

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)

Related Items

Spectral properties of Cayley graphs over \(M_{m \times n}(F_q)\) ⋮ Asymptotic Delsarte cliques in distance-regular graphs ⋮ On distance-regular graphs with smallest eigenvalue at least \(- m\) ⋮ Diameter bounds for geometric distance-regular graphs ⋮ Restrictions on classical distance-regular graphs ⋮ Matrix graphs and MRD codes over finite principal ideal rings ⋮ On the nonexistence of pseudo-generalized quadrangles ⋮ Geometric aspects of 2-walk-regular graphs ⋮ On the automorphism groups of strongly regular graphs. II. ⋮ On some recent progress in the classification of (\(P\) and \(Q\))-polynomial association schemes ⋮ The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters ⋮ Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey ⋮ Thin \(Q\)-polynomial distance-regular graphs have bounded \(c_2\)