Graph Theoretical and Algorithmic Characterizations of Positive Definite Symmetric Quasi-Cartan Matrices (Q4589248)

From MaRDI portal
Revision as of 08:22, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6804766
Language Label Description Also known as
English
Graph Theoretical and Algorithmic Characterizations of Positive Definite Symmetric Quasi-Cartan Matrices
scientific article; zbMATH DE number 6804766

    Statements

    Graph Theoretical and Algorithmic Characterizations of Positive Definite Symmetric Quasi-Cartan Matrices (English)
    0 references
    0 references
    0 references
    9 November 2017
    0 references
    positive unit forms
    0 references
    Dynkin-type
    0 references
    edge-bipartite graphs
    0 references
    combinatorial algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references