Publicação

Totally nonpositive completions on partial matrices

Ver documento

Detalhes bibliográficos
Resumo: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.
Autores principais:Araújo, C. Mendes
Outros Autores:Torregrosa, Juan R.; Urbano, Ana M.
Assunto:Partial matrix Totally nonpositive matrix Graph Completion problems completion problem undirected graphs
Ano:2006
País:Portugal
Tipo de documento:artigo
Tipo de acesso:acesso aberto
Instituição associada:Universidade do Minho
Idioma:inglês
Origem:RepositóriUM - Universidade do Minho
Descrição
Resumo: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.