Root systems and the Johnson and Hamming graphs

DOI10.1016/S0195-6698(87)80023-9zbMATH Open0614.05048OpenAlexW2019781231MaRDI QIDQ1820176FDOQ1820176

Authors: Paul 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

Recommendations

• Characerization of a class of distance regular graphs.
• Distance-regular graphs of Hamming type
• scientific article; zbMATH DE number 3906524
• On local structure of a distance-regular graph of Hamming type
• scientific article; zbMATH DE number 43547

zbMATH Keywords

distance regular graphroot systems

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (20)

• The classification of finite connected hypermetric spaces
• Root system graphs
• The classification of distance-regular graphs of type IIB
• The subconstituent algebra of an association scheme. I
• The distance-regular graphs such that all of its second largest local eigenvalues are at most one
• The association schemes of dual polar spaces of type \(^ 2A_{2d- 1}(p^ f)\) are characterized by their parameters if \(d\geq 3\)
• A unified view of inequalities for distance-regular graphs. I
• Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I
• The structure of spherical graphs.
• Exceptional graphs with smallest eigenvalue -2 and related problems
• An inequality for regular near polygons
• The diameters graph of the root system \(E_8\) is uniquely geometrisable
• A characterization of \(P\)- and \(Q\)-polynomial association schemes
• Intersection numbers of bipartite distance-regular graphs
• 1-homogeneous graphs with cocktail party \({\mu}\)-graphs
• On subgraphs in distance-regular graphs
• A class of distance-regular graphs that are \(\phi\)-polynomial
• Title not available (Why is that?)
• Balanced sets and Q-polynomial association schemes
• P and Q polynomial schemes with \(q=-1\)

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

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