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.
| Original language | American English |
|---|---|
| Pages (from-to) | 1522-1530 |
| Number of pages | 9 |
| Journal | Linear and Multilinear Algebra |
| Volume | 67 |
| Issue number | 8 |
| DOIs | |
| State | Published - Apr 19 2018 |
| Externally published | Yes |
Bibliographical note
Publisher Copyright:© 2018, © 2018 Informa UK Limited, trading as Taylor & Francis Group.
ASJC Scopus Subject Areas
- Algebra and Number Theory
Keywords
- 15B51
- 15A83
- doubly substochastic matrices
- term rank
- 15B36
- (0, 1)-matrices
- maximum diagonal
Disciplines
- Mathematics
Fingerprint
Dive into the research topics of 'A Minimal Completion of (0, 1)-Matrices Without Total Support'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS