TY - JFULL AU - Gu-Fang Mou and Ting-Zhu Huang PY - 2011/3/ TI - The Partial Non-combinatorially Symmetric N10 -Matrix Completion Problem T2 - International Journal of Mathematical and Computational Sciences SP - 123 EP - 128 VL - 5 SN - 1307-6892 UR - https://publications.waset.org/pdf/11521 PU - World Academy of Science, Engineering and Technology NX - Open Science Index 50, 2011 N2 - An n×n matrix is called an N1 0 -matrix if all principal minors are non-positive and each entry is non-positive. In this paper, we study the partial non-combinatorially 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. ER -