The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph (Q332633)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph |
scientific article; zbMATH DE number 6649144
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph |
scientific article; zbMATH DE number 6649144 |
Statements
The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph (English)
0 references
8 November 2016
0 references
symmetric matrix
0 references
multiplicity of an eigenvalue
0 references
minimal rank
0 references
0 references
0 references
0.805559515953064
0 references
0.7887631058692932
0 references
0.7872818112373352
0 references
0.7836019396781921
0 references
