Minimum matrix rank of k-regular (0,1) matrices

DOI10.1016/0024-3795(90)90240-DzbMath0701.15009MaRDI QIDQ913893

J. Richard Lundgren, Kim A. S. Hefner

Publication date: 1990

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

digraphspartition numbersk- regular bipartite graphsk-regular (0,1)-matricesminimum biclique covering numbersminimum Boolean and nonnegative integer ranksemiring ranks

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Matrices of integers (15B36) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items (3)

Further results on the minimum rank of regular classes of \((0,1)\)-matrices ⋮ Boolean rank of upset tournament matrices ⋮ On upper bounds for the minimum rank of regular classes of (0,1)-matrices

Cites Work

• Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices
• On the minimum rank of regular classes of matrices of zeros and ones
• Singular (0,1) matrices with constant row and column sums
• Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimum matrix rank of k-regular (0,1) matrices