A graph theoretic upper bound on the permanent of a nonnegative integer matrix. II. The extremal case (Q801134)
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 3877358
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A graph theoretic upper bound on the permanent of a nonnegative integer matrix. II. The extremal case |
scientific article; zbMATH DE number 3877358 |
Statements
A graph theoretic upper bound on the permanent of a nonnegative integer matrix. II. The extremal case (English)
0 references
1984
0 references
[For part I see ibid. 61, 187-198 (1984; reviewed above)]. Let A be a fully indecomposable \(n\times n\) matrix with integer entries and row and column sums \(r_ i\) and \(c_ i\), respectively. Matrices A are characterized for which per A\(=1+\min [\prod_{i}(r_ i- 1),\prod_{i}(c_ i-1)]\) holds.
0 references
multigraphs
0 references
permanent
0 references
nonnegative integer matrix
0 references
fully indecomposable
0 references
0 references
0.9501213431358336
0 references
0.8886948227882385
0 references
0.8886948227882385
0 references
0.8313642144203186
0 references
0.8313642144203186
0 references
