On the Relationship Between Graphs and Totally Positive Matrices

DOI10.1137/S089547989630396XMaRDI QIDQ4389080zbMATH OpenFDO

Authors J. M. Peña

Publication date 11 May 1998

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

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)

Recommendations

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

Cited in

(11)

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

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)