Representation of signed graphs by root system \(E_ 8\) (Q1343233)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Representation of signed graphs by root system \(E_ 8\)
scientific article

    Statements

    Representation of signed graphs by root system \(E_ 8\) (English)
    0 references
    0 references
    1 February 1995
    0 references
    A graph together with a mapping from the set of edges to the set \(\{1, - 1\}\) is called a sigraph. If \(A\) is the \((1, -1, 0)\)-adjacency matrix of a sigraph, then the matrix \(A+ 2I\) can be interpreted as the Gram matrix of a set of vectors in a real vector space. The author studies sigraphs in which this set of vectors is a subset of the root system \(E_ 8\). The set of minimal forbidden sigraphs for such sigraphs is described. Minimal forbidden sigraphs have at most 10 vertices.
    0 references
    adjacency matrix
    0 references
    sigraph
    0 references
    Gram matrix
    0 references
    root system
    0 references
    minimal forbidden sigraphs
    0 references

    Identifiers