Rank decomposition under combinatorial constraints

DOI10.1016/0024-3795(95)00548-XMaRDI QIDQ5961693zbMATH OpenFDO

Authors Charles R. Johnson, Jeremy Miller

Publication date 2 August 1999

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

Full work available at URL https://doi.org/10.1016/0024-3795(95)00548-X

zbMATH Keywords

bipartite chordal graphsbipartite graphmatrixrank

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• Rank decompositions and signed bigraphs
• Rank decomposability in incident spaces
• Decompositions of minimum rank matrices
• Skew rank decompositions
• Biclique comparability digraphs of bipartite graphs and minimum ranks of partial matrices

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 41508 (Why is no real title available?)
• Operators of Finite Rank in Nest Algebras

Cited in

(11)

• Biclique decompositions and Hermitian rank
• Matrix completions and chordal graphs
• Biclique comparability digraphs of bipartite graphs and minimum ranks of partial matrices
• Rank decomposability in incident spaces
• Skew rank decompositions
• Rank decomposition under zero pattern constraints and \(\mathsf{L}\)-free directed graphs
• Rank decomposition in zero pattern matrix algebras.
• Decompositions of minimum rank matrices
• scientific article; zbMATH DE number 741201 (Why is no real title available?)
• Minimum-rank and maximum-nullity of graphs and their linear preservers
• A matching-minor monotone parameter for bipartite graphs

This page was built for publication: Rank decomposition under combinatorial constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5961693)