Please use this identifier to cite or link to this item: https://hdl.handle.net/1822/5741

TitleTotally nonpositive completions on partial matrices
Author(s)Araújo, C. Mendes
Torregrosa, Juan R.
Urbano, Ana M.
KeywordsPartial matrix
Totally nonpositive matrix
Graph
Completion problems
completion problem
undirected graphs
Issue dateMar-2006
PublisherElsevier
JournalLinear Algebra and its Applications
Citation"Linear Algebra and its Applications". ISSN 0024-3795. 413:2-3 (Mar. 2006) 403-424.
Abstract(s)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.
TypeArticle
URIhttps://hdl.handle.net/1822/5741
DOI10.1016/j.laa.2005.05.013
ISSN0024-3795
Publisher versionwww.sciencedirect.com
Peer-Reviewedyes
AccessOpen access
Appears in Collections:CMAT - Artigos em revistas com arbitragem / Papers in peer review journals

Files in This Item:
File Description SizeFormat 
tnpLAA2.pdf182,27 kBAdobe PDFView/Open

Partilhe no FacebookPartilhe no TwitterPartilhe no DeliciousPartilhe no LinkedInPartilhe no DiggAdicionar ao Google BookmarksPartilhe no MySpacePartilhe no Orkut
Exporte no formato BibTex mendeley Exporte no formato Endnote Adicione ao seu ORCID