The minimum rank completion problems for tri-diagonal partial full sign patterns

DOI10.3969/J.ISSN.1001-8395.2017.03.003MaRDI QIDQ3132031zbMATH OpenFDO

Authors Gu-Fang Mou, Tian-fei Wang

Publication date 29 January 2018

Full work available at URL https://doi.org/10.3969/J.ISSN.1001-8395.2017.03.003

zbMATH Keywords

bipartite zero forcing numberfull sign patternminimum rank completion problemsigned bipartite graph

Mathematics Subject Classification ID

Vector spaces, linear dependence, rank, lineability (15A03) Matrix completion problems (15A83) Sign pattern matrices (15B35)

Recommendations

• The minimum rank completion problems for tri-diagonal partial full sign patterns
• scientific article; zbMATH DE number 2144792
• The extent to which triangular sub-patterns explain minimum rank
• Unicity of minimal rank completions for tri-diagonal partial block matrices
• Minimal rank completions of partial banded matrices

Cited in

(3)

• Symmetric completions of cycles and bipartite graphs
• The minimum rank completion problems for tri-diagonal partial full sign patterns
• The extent to which triangular sub-patterns explain minimum rank

This page was built for publication: The minimum rank completion problems for tri-diagonal partial full sign patterns

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