A Minimal Completion of (0, 1)-Matrices Without Total Support
Linear and Multilinear Algebra
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.
Cao, Lei, "A Minimal Completion of (0, 1)-Matrices Without Total Support" (2019). Mathematics Faculty Articles. 277.