Article
A Minimal Completion of (0, 1)-Matrices Without Total Support
Linear and Multilinear Algebra
Document Type
Article
Publication Date
8-1-2019
Disciplines
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.
ORCID ID
0000-0001-7613-7191
ResearcherID
G-7341-2019
DOI
10.1080/03081087.2018.1460793
Citation Information
Lei Cao. "A Minimal Completion of (0, 1)-Matrices Without Total Support" Linear and Multilinear Algebra Vol. 67 Iss. 8 (2019) p. 1522 - 1530 ISSN: 0308-1087 Available at: http://works.bepress.com/lei-cao/2/
©2018 Informa UK Limited, trading as Taylor & Francis Group