On the Relationship Between Graphs and Totally Positive Matrices

DOI10.1137/S089547989630396XzbMATH Open0912.15024MaRDI QIDQ4389080FDOQ4389080

Authors: J. M. Peña 

Publication date: 11 May 1998

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Recommendations

• Totally positive matrices and totally positive hypergraphs
• The totally positive completion problem
• scientific article; zbMATH DE number 151754

zbMATH Keywords

graphdigraphtotally positive matrixnonintersecting paths

Mathematics Subject Classification ID

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

Cited In (11)

• Determinantal criteria for total positivity
• Partially prescribed matrices associated to directed graphs
• Matrices totally positive relative to a tree. II.
• Paths in directed graphs and spectral properties of matrices
• Nonnegative Idempotent Matrices and Their Graphs
• The relation between the Jordan structure of a matrix and its graph
• Note on Graphs and Matrix Inequalities
• Totally positive matrices and totally positive hypergraphs
• Gaussian Markov random fields and totally positive matrices
• Scaffoldings of totally positive matrices and line insertion
• Matrices Totally Positive Relative to a Tree

This page was built for publication: On the Relationship Between Graphs and Totally Positive Matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4389080)