Algorithms for generalized stability numbers of tree graphs
- 1 February 1966
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of the Australian Mathematical Society
- Vol. 6 (1) , 89-100
- https://doi.org/10.1017/s1446788700004031
Abstract
In this paper we give some algorithms for determining αw(T) and βw(T), the generalized internal and external stability numbers respectively, of a finite directed tree graph T whose nodes are weighted by a function w. We define αw(T) and βw in section 2. When w gives every node of T the weight 1 then αw(T) = α(T) and βw(T) = β(T) where α(T) and β(T) are the usual stability numbers.Keywords
This publication has 2 references indexed in Scilit:
- Theory of GraphsPublished by American Mathematical Society (AMS) ,1962
- The number of trees with nodes of alternate parityMathematical Proceedings of the Cambridge Philosophical Society, 1962