Abstract
A sign pattern matrix A is called potentially stable if there exists a real matrix B∈Q(A) such that B is stable. A combinatorially symmetric sign pattern matrix A is called tree (star) sign pattern if its graph G(A) is a tree (star). In this paper, a characterization for a star sign pattern matrix being potentially stable is presented.
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.
