Graph characterization of fully indecomposable nonconvertible (0, 1)-matrices with minimal number of ones

DOI10.26493/1855-3974.1517.e42zbMath1433.05174OpenAlexW2972752230MaRDI QIDQ5217066

M. V. Budrevich, Bojan Kuzma, Alexander E. Guterman, Gregor Dolinar

Publication date: 21 February 2020

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.1517.e42

zbMATH Keywords

permanentindecomposable matrices

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Commutativity of matrices (15A27) Linear transformations, semilinear transformations (15A04) Connectivity (05C40)

Related Items (1)

Permanent Polya problem for additive surjective maps

Cites Work

• Unnamed Item
• The complexity of computing the permanent
• Kräuter conjecture on permanents is true
• On the values of the permanent of \((0,1)\)-matrices
• Pólya's permanent problem
• A characterization of convertible (0,1)-matrices
• Permanents, Pfaffian orientations, and even directed circuits
• Lower bounds for Pólya’s problem on permanent
• Conversion of the Permanent into the Determinant

This page was built for publication: Graph characterization of fully indecomposable nonconvertible (0, 1)-matrices with minimal number of ones