Totally nonpositive completions on partial matrices

• Autor(es): Araújo, C. Mendes ; Torregrosa, Juan R. ; Urbano, Ana M.
• Data: 2006
• Identificador Persistente: http://hdl.handle.net/1822/5741
• Origem: RepositóriUM - Universidade do Minho
• Assunto(s): Partial matrix; Totally nonpositive matrix; Graph; Completion problems
• Tipo de Documento: Artigo
• Idioma: Inglês

Descrição

An n £ n real matrix is said to be totally no positive if every minor is no positive. In this paper, we are interested in totally no positive completion problems, that is, does A partial totally no positive matrix have a totally no positive matrix completion? This Problem has, in general, a negative answer. Therefore, we analyze the question: for which Labelled graphs G does every partial totally no positive matrix, whose associated graph is G, have a totally no positive completion? Here we study the mentioned problem when G Is a choral graph or an undirected cycle.