Abstract
A new class of nonnegative matrices, called the path product (PP) matrices, is introduced. Every inverse M-matrix is PP and this fact gives transparent proofs of a number of facts about inverse M-matrices that hold in a broader setting. For n≤ 3 (and not greater) the (strict) PP matrices are exactly the inverse M-matrices. Finally, the PP matrices are studied, a number of properties given, and the completion problem is solved for partial PP matrices. Unlike other properties inherited by principal submatrices, there is no graphtheoretic restriction on completability of partial PP matrices.
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.
