Title of article
On the potential stability of star sign pattern matrices Original Research Article
Author/Authors
Yubin Gao، نويسنده , , Jiongsheng Li، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
8
From page
61
To page
68
Abstract
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.
Keywords
Sign pattern matrix , star graph , Potential stability
Journal title
Linear Algebra and its Applications
Serial Year
2001
Journal title
Linear Algebra and its Applications
Record number
823229
Link To Document