Root systems and the Johnson and Hamming graphs
Let \(\Gamma\) be any distance regular graph with diameter d, \(c_ 2\geq 0\) and \[ c_ i-c_{i-1}+b_{i-1}-b_ i-a_ i-2=0. \] Then it is shown that \(\Gamma\) is a graph of Hamming type one of the Johnson graphs, the halved graph of the n-cube, a cocktail party graph, the Shrikhande graph or one of a finite number of exceptional graphs with \(d\leq 8.\) This result improves an earlier result of the author. The proof is built round the idea that any \(\Gamma\) satisfying the equation above can be represented by a set of equi-length vectors spanning a Euclidean space which also contains a root system consisting of an orthogonal union of root systems of type \(A_ n\), \(D_ n\), \(E_ 6\), \(E_ 7\), \(E_ 8\). The graphs listed above appear as consequences of the form of the root system.
- A characterization of tetrahedral graphs
- A characterization of the Tm graph
- A new 5‐arc‐transitive cubic graph
- Automorphic graphs and the Krein condition
- Characterization of H(n,q) by the parameters
- Characterization of the graphs of the Johnson schemes G(3k,k) and G(3k+1,k)
- Characterization of the odd graphs \(O_ k \)by parameters
- Distance-regular graphs and (s,c,a,k)-graphs
- Distance-regular graphs with girth 3 or 4: I
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 3145665 (Why is no real title available?)
- scientific article; zbMATH DE number 3758369 (Why is no real title available?)
- scientific article; zbMATH DE number 3759173 (Why is no real title available?)
- scientific article; zbMATH DE number 3266233 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- Infinite distance transitive graphs of finite valency
- Introduction to Lie Algebras and Representation Theory
- Line graphs, root systems, and elliptic geometry
- On a Characterization of the Triangular Association Scheme
- On the tetrahedral graph
- On the uniqueness of the graphs G(n,k) of the Johnson schemes
- On the uniqueness of the tetrahedral association schemes
- On the Uniqueness of the Triangular Association Scheme
- The diameter of bipartite distance-regular graphs
- The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)
- The Uniqueness of the $\mathrm{L}_2$ Association Scheme
- The Uniqueness of the Triangular Association Scheme
- There are only finitely many finite distance-transitive graphs of given valency greater than two
- A class of distance-regular graphs that are \(\phi\)-polynomial
- The classification of finite connected hypermetric spaces
- Root system 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\)
- Intersection numbers of bipartite distance-regular graphs
- 1-homogeneous graphs with cocktail party \({\mu}\)-graphs
- The structure of spherical graphs.
- An inequality for regular near polygons
- The diameters graph of the root system \(E_8\) is uniquely geometrisable
- Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I
- A unified view of inequalities for distance-regular graphs. I
- Exceptional graphs with smallest eigenvalue -2 and related problems
- scientific article; zbMATH DE number 3895117 (Why is no real title available?)
- The distance-regular graphs such that all of its second largest local eigenvalues are at most one
- On subgraphs in distance-regular graphs
- The subconstituent algebra of an association scheme. I
- The classification of distance-regular graphs of type IIB
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)
