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\).











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)