Gu-Fang Mou and Ting-Zhu Huang The Partial Noncombinatorially Symmetric N10 Matrix Completion Problem
124 - 128
2011
5
2
International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering http://waset.org/publications/11521
http://waset.org/publications/50
World Academy of Science, Engineering and Technology
An n×n matrix is called an N1 0 matrix if all principal minors are nonpositive and each entry is nonpositive. In this paper, we study the partial noncombinatorially symmetric N1 0 matrix completion problems if the graph of its specified entries is a transitive tournament or a double cycle. In general, these digraphs do not have N1 0 completion. Therefore, we have given sufficient conditions that guarantee the existence of the N1 0 completion for these digraphs.
International Science Index 50, 2011