On the potential stability of star sign pattern matrices Original Research Article

A sign pattern matrix A is called potentially stable if there exists a real matrix Bset membership, variantQ(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.