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

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 16:29, 5 March 2024

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