The N01-matrix completion problem

• Gu-Fang Mou ^[1] ; Ting-Zhu Huang ^[1]
  1. [1] University of Electronic Science and Technology of China

     University of Electronic Science and Technology of China

     China

     
• Localización: Revista de la Unión Matemática Argentina, ISSN 0041-6932, ISSN-e 1669-9637, Vol. 54, Nº. 1, 2013, págs. 1-14
• Idioma: inglés
• Enlaces
  • Texto completo (pdf)
• Resumen

  • 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.