Characerization of a class of distance regular graphs.

DOI10.1515/CRLL.1985.357.182zbMath0552.05042OpenAlexW4238202411MaRDI QIDQ3344020

Arnold Neumaier

Publication date: 1985

Published in: Journal für die reine und angewandte Mathematik (Crelles Journal) (Search for Journal in Brave)

Full work available at URL: https://www.digizeitschriften.de/dms/resolveppn/?PPN=GDZPPN002202328

zbMATH Keywords

Johnson graphsdistance regular graphsroot lattice

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (05C99) Quadratic forms (reduction theory, extreme forms, etc.) (11H55)

Related Items (21)

The classification of finite connected hypermetric spaces ⋮ Balanced sets and Q-polynomial association schemes ⋮ A local characterization of the Johnson scheme ⋮ On distance-regular graphs with height two ⋮ A characterization of \(P\)- and \(Q\)-polynomial association schemes ⋮ The association schemes of dual polar spaces of type \(^ 2A_{2d- 1}(p^ f)\) are characterized by their parameters if \(d\geq 3\) ⋮ P and Q polynomial schemes with \(q=-1\) ⋮ On distance-regular graphs with height two. II ⋮ Exceptional graphs with smallest eigenvalue -2 and related problems ⋮ 1-homogeneous graphs with cocktail party \({\mu}\)-graphs ⋮ The Terwilliger polynomial of a \(Q\)-polynomial distance-regular graph and its application to pseudo-partition graphs ⋮ The subconstituent algebra of an association scheme. I ⋮ An inequality for regular near polygons ⋮ On graphs without crowns with regular \(\mu\)-subgraphs ⋮ On some recent progress in the classification of (\(P\) and \(Q\))-polynomial association schemes ⋮ The Terwilliger algebra of the halved \(n\)-cube from the viewpoint of its automorphism group action ⋮ Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I ⋮ The classification of distance-regular graphs of type IIB ⋮ Locally triangular graphs and rectagraphs with symmetry ⋮ A class of distance-regular graphs that are \(\phi\)-polynomial ⋮ The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)

This page was built for publication: Characerization of a class of distance regular graphs.