A minimal completion of (0,1)-matrices without total support

作者：Cao, Lei^*

来源：Linear and Multilinear Algebra, 2019, 67(8): 1522-1530.

DOI：10.1080/03081087.2018.1460793

• (0,1)-matrices
• doubly substochastic matrices
• term rank
• maximum diagonal

In this paper, we provide a method to complete a (0, 1)-matrix without total support via the minimal doubly stochastic completion of doubly substochastic matrices and show that the size of the completion is determined by the maximum diagonal sum or the term rank of the given (0, 1)-matrix.

• 出版日期2019-8-3
• 单位山东师范大学