The inverse eigenvalue problem of a graph: multiplicities and minors (Q1985452)
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 inverse eigenvalue problem of a graph: multiplicities and minors |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The inverse eigenvalue problem of a graph: multiplicities and minors |
scientific article |
Statements
The inverse eigenvalue problem of a graph: multiplicities and minors (English)
0 references
7 April 2020
0 references
inverse eigenvalue problem
0 references
strong Arnold property
0 references
strong spectral property
0 references
strong multiplicity property
0 references
Colin de Verdière type parameter
0 references
maximum multiplicity
0 references
distinct eigenvalues
0 references
0 references
0 references
0 references
0.9304295
0 references
0.92508495
0 references
0.92508495
0 references
0.92229044
0 references
0.91770977
0 references
0.9120244
0 references
0.91112596
0 references
0.91045445
0 references