Excellence in Research and Innovation for Humanity
@article{(International Science Index):http://waset.org/publications/11521,
  title    = {The Partial Non-combinatorially Symmetric N10 -Matrix Completion Problem},
  author    = {Gu-Fang Mou and  Ting-Zhu Huang},
  country   = {},
  abstract  = {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.
    journal   = {International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering},  volume    = {5},
  number    = {2},
  year      = {2011},
  pages     = {124 - 128},
  ee        = {http://waset.org/publications/11521},
  url       = {http://waset.org/Publications?p=50},
  bibsource = {http://waset.org/Publications},
  issn      = {eISSN:1307-6892},
  publisher = {World Academy of Science, Engineering and Technology},
  index     = {International Science Index 50, 2011},