%0 Journal Article
	%A Gu-Fang Mou and  Ting-Zhu Huang
	%D 2011
	%J International Journal of Mathematical and Computational Sciences
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 50, 2011
	%T The Partial Non-combinatorially Symmetric N10 -Matrix Completion Problem
	%U https://publications.waset.org/pdf/11521
	%V 50
	%X 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.

	%P 124 - 128