(0, 1)-matrices with minimal permanents
暂无分享，去创建一个
It is shown that the permanent of a totally indecomposable (0,1)-matrix is equal to its largest row sum if and only if all its other row sums are 2.
[1] H. Minc. A lower bound for permanents of (0,1)-matrices , 1967 .
[2] D. Hartfiel. A Simplified Form for Nearly Reducible and Nearly Decomposable Matrices , 1970 .
[3] H. Minc. Nearly decomposable matrices , 1972 .