Lower bound for the cost of connecting tree with given vertex degree sequence (Q4958799)
From MaRDI portal
scientific article; zbMATH DE number 7395637
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
