Graph Theoretical and Algorithmic Characterizations of Positive Definite Symmetric Quasi-Cartan Matrices (Q4589248): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:02, 7 February 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
9 November 2017
0 references
positive unit forms
0 references
Dynkin-type
0 references
edge-bipartite graphs
0 references
combinatorial algorithms
0 references
