A minimal completion of (0, 1)-matrices without total support |
| |
| Authors: | Lei Cao |
| |
| Affiliation: | 1. School of Mathematical Sciences, Shandong Normal University , Shandong, China.;2. Department of Mathematics, Georgian Court University , NJ, USA. |
| |
| Abstract: | 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. |
| |
| Keywords: | (0, 1)-matrices doubly substochastic matrices term rank maximum diagonal |
|
|
