Matrices of 0's and 1's with total support

DOI10.1016/0097-3165(80)90068-0zbMath0475.05018OpenAlexW2068007850MaRDI QIDQ1159675

Richard A. Brualdi

Publication date: 1980

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(80)90068-0

zbMATH Keywords

(0,1)-matrixfully indecomposable

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Matrices of integers (15B36)

Related Items

The Bruhat rank of a binary symmetric staircase pattern, Diagonal Scalings for the Eigenstructure of Arbitrary Pencils, Matrices of zeros and ones with fixed row and column sum vectors, Integral matrices with given row and column sums, A minimal completion of (0, 1)-matrices without total support, Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings, Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs, Combinatorial analysis (nonnegative matrices, algorithmic problems)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theorem on flows in networks
• Convex polyhedra of doubly stochastic matrices. I: Applications of the permanent function
• Transversal theory. An account of some aspects of combinatorial mathematics
• Combinatorial Properties of Matrices of Zeros and Ones
• The Term Rank of a Matrix
• Coverings of Bipartite Graphs
• The Distribution of Positive Elements in Doubly-Stochastic Matrices
• Traces of Matrices of Zeros and Ones