The graphs of the unambiguous entries in the product of two \((+,-)\) sign pattern matrices (Q1361772)
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 graphs of the unambiguous entries in the product of two (+,-) sign pattern matrices |
scientific article; zbMATH DE number 1040490
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The graphs of the unambiguous entries in the product of two \((+,-)\) sign pattern matrices |
scientific article; zbMATH DE number 1040490 |
Statements
The graphs of the unambiguous entries in the product of two \((+,-)\) sign pattern matrices (English)
0 references
9 September 1997
0 references
The authors consider a model problem in qualitative matrix technology, namely the possible arrangements of unambiguously signed entries in a product of sign pattern matrices. Among many results, the permutation digraphs that occur as digraphs of the unambiguous entries of the square of a sign pattern matrix are characterized.
0 references
permutation digraphs
0 references
sign pattern matrix
0 references
0.7402108311653137
0 references
0.73755943775177
0 references
0.7329152822494507
0 references
