Root system graphs
From MaRDI portal
The author considers vertices of a graph as equal-length vectors spanning a Euclidean space that is also spanned by a root system \(\Phi\) such that vertices are adjacent if and only if this difference is in \(\Phi\).
Recommendations
Cites work
- A new 5‐arc‐transitive cubic graph
- Graphs with eigenvalues at least - 2
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 3608081 (Why is no real title available?)
- scientific article; zbMATH DE number 3392741 (Why is no real title available?)
- Introduction to Lie Algebras and Representation Theory
- Line graphs, root systems, and elliptic geometry
- Root systems and the Johnson and Hamming graphs
- The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)
Cited in
(4)
This page was built for publication: Root system graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1099192)