Lower bound for the cost of connecting tree with given vertex degree sequence (Q4958799)
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: Lower bound for the cost of connecting tree with given vertex degree sequence |
scientific article; zbMATH DE number 7395637
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bound for the cost of connecting tree with given vertex degree sequence |
scientific article; zbMATH DE number 7395637 |
Statements
Lower bound for the cost of connecting tree with given vertex degree sequence (English)
0 references
15 September 2021
0 references
optimal communication network
0 references
generalized Wiener index
0 references
origin-destination matrix
0 references
semidefinite programming
0 references
bilinear matrix inequality
0 references
0.7349041700363159
0 references
0.7226359248161316
0 references
0.7207217812538147
0 references
0.7191178798675537
0 references
