A graph theoretic upper bound on the permanent of a nonnegative integer matrix. I (Q801133)
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 3877357
| 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. I |
scientific article; zbMATH DE number 3877357 |
Statements
A graph theoretic upper bound on the permanent of a nonnegative integer matrix. I (English)
0 references
1984
0 references
If A is a fully indecomposable \(n\times n\) matrix with nonnegative integer entries which has row and column \(r_ i\) and \(c_ i\), respectively, then \(per A\leq 1+\min [\prod_{i}(r_ i-1),\quad \prod_{i}(c_ i-1)].\)
0 references
permanent
0 references
nonnegative integer matrix
0 references
multigraph
0 references
fully indecomposable
0 references
0 references
0 references
0 references
0.9501213431358336
0 references
0.9014273881912231
0 references
0.9014273881912231
0 references
0.8372998833656311
0 references
0.8372998833656311
0 references
