The minimum rank completion problems for tri-diagonal partial full sign patterns (Q4625537)
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 minimum rank completion problems for tri-diagonal partial full sign patterns |
scientific article; zbMATH DE number 7029092
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum rank completion problems for tri-diagonal partial full sign patterns |
scientific article; zbMATH DE number 7029092 |
Statements
22 February 2019
0 references
directed networks system
0 references
sign pattern matrix
0 references
sign bipartite graph
0 references
minimum driving node
0 references
minimum zero forcing number
0 references
0.8110175728797913
0 references
0.7773821949958801
0 references
0.7614321708679199
0 references
0.7540116906166077
0 references
