Root systems and the Johnson and Hamming graphs

DOI10.1016/S0195-6698(87)80023-9zbMath0614.05048OpenAlexW2019781231MaRDI QIDQ1820176

Paul M. Terwilliger

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/s0195-6698(87)80023-9

zbMATH Keywords

root systemsdistance regular graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph theory (05C99)

Related Items (18)

The classification of finite connected hypermetric spaces ⋮ Root system graphs ⋮ Intersection numbers of bipartite distance-regular graphs ⋮ Balanced sets and Q-polynomial association schemes ⋮ 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\) ⋮ A unified view of inequalities for distance-regular graphs. I ⋮ Exceptional graphs with smallest eigenvalue -2 and related problems ⋮ 1-homogeneous graphs with cocktail party \({\mu}\)-graphs ⋮ The structure of spherical graphs. ⋮ On subgraphs in distance-regular graphs ⋮ The subconstituent algebra of an association scheme. I ⋮ An inequality for regular near polygons ⋮ The distance-regular graphs such that all of its second largest local eigenvalues are at most one ⋮ Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I ⋮ The classification of distance-regular graphs of type IIB ⋮ A class of distance-regular graphs that are \(\phi\)-polynomial

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)
• Distance-regular graphs with girth 3 or 4: I
• Characterization of H(n,q) by the parameters
• The diameter of bipartite distance-regular graphs
• Infinite distance transitive graphs of finite valency
• Characterization of the odd graphs \(O_ k \)by parameters
• Automorphic graphs and the Krein condition
• Line graphs, root systems, and elliptic geometry
• On the uniqueness of the tetrahedral association schemes
• Characterization of the graphs of the Johnson schemes G(3k,k) and G(3k+1,k)
• On the uniqueness of the graphs G(n,k) of the Johnson schemes
• There are only finitely many finite distance-transitive graphs of given valency greater than two
• Distance-regular graphs and (s,c,a,k)-graphs
• On the tetrahedral graph
• The Uniqueness of the Triangular Association Scheme
• The Uniqueness of the $\mathrm{L}_2$ Association Scheme
• On a Characterization of the Triangular Association Scheme
• On the Uniqueness of the Triangular Association Scheme
• A characterization of tetrahedral graphs
• A characterization of the Tm graph
• Introduction to Lie Algebras and Representation Theory
• A new 5‐arc‐transitive cubic graph

This page was built for publication: Root systems and the Johnson and Hamming graphs