A graph theoretic upper bound on the permanent of a nonnegative integer matrix. I (Q801133): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0024-3795(84)90030-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1995854161 / rank | |||
Normal rank | |||
Revision as of 18:49, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A graph theoretic upper bound on the permanent of a nonnegative integer matrix. I |
scientific article |
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
