|
ON STABLE SUBSETS AND STABLE INDICES OF TREES
Guang Hui XU, Jia Yu SHAO
Acta Mathematicae Applicatae Sinica
2003, 26 (2):
252-263.
DOI: 10.12387/C2003027
The study of sign stability of a real square matrix has important applications in various areas such as economics, ecology, and so on. In this paper, the sign stability problem for matrices is turned into an equivalent graph theoretical problem,namely,the stability problem for the vertex subsets of tress.We introduce the concept of stable vertex subsets of tress and give a recursive method for recognizing them.We also introduce for trees a new parameter,stable index,which is the smallest cardinality among all the stable nertex subsets of the tree.We prove a min-max type theorem for stable index,give a sharp upper bound for the stable indices of tress of order n,and gine a complete characterization for the extreme tress whose stable indices attaining this upper bound.
Related Articles |
Metrics |
Comments(0)
|
|