The completable digraphs for the totally nonnegative completion problem

DOI10.1016/j.laa.2008.07.009zbMath1191.05053OpenAlexW2064042831MaRDI QIDQ1002270

Ramadán el-Ghamry, Juan Ramón Torregrosa Sánchez, Cristina Jordán Lluch

Publication date: 25 February 2009

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2008.07.009

zbMATH Keywords

directed graphpartial matrixtotally nonnegative matrixcompletion problem

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• The totally positive completion problem
• Totally positive matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The completable digraphs for the totally nonnegative completion problem