Abstract
A real matrix is said to be totally positive if all its minors are nonnegative. In this paper it is shown that properties of totally positive matrices can be applied to graph theory, and conversely. In fact, some properties of undirected and directed graphs (digraphs) are characterized in terms of the associated totally positive matrices. Some results on the existence of nonintersecting paths in a digraph are also provided.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
