Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 1

non-combinatorially symmetric Related Publications

1 The Partial Non-combinatorially Symmetric N10 -Matrix Completion Problem

Authors: Gu-Fang Mou, Ting-Zhu Huang

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.

Keywords: digraph, matrix completion, cycle, N10 -matrix, non-combinatorially symmetric

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 751