Resumen de The N01-matrix completion problem
Gu Fang Mou, Ting Zhu Huang
An n × n matrix is called an N1/0-matrix if all its principal minors are non-positive and each entry is non-positive. In this paper, we study general combinatorially symmetric partial N1/0 -matrix completion problems and prove that a combinatorially symmetric partial N10-matrix with all specified offdiagonal entries negative has an N1/0-matrix completion if the graph of its specified entries is an undirected cycle or a 1-chordal graph.
