The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample (Q836996)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5602601
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample |
scientific article; zbMATH DE number 5602601 |
Statements
The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample (English)
0 references
10 September 2009
0 references
combinatorial matrix theory
0 references
graph
0 references
Hermitian
0 references
inertia
0 references
minimum rank
0 references
symmetric
0 references
tree
0 references
0 references
0 references
0 references
0 references
0 references
0.8422482013702393
0 references
0.7882816791534424
0 references
0.7769237160682678
0 references
0.776441216468811
0 references
0.7703810930252075
0 references
