Abstract
The independence saturation number [Formula: see text] of a graph [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the maximum cardinality of an independent set that contains [Formula: see text]. The strong independent saturation number [Formula: see text] of a graph [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the maximum cardinality of a minimal strong independent dominating set of [Formula: see text] that contains [Formula: see text]. This paper is devoted to the computation of independence saturation and strong independent saturation numbers of 3- and 4-layered probabilistic neural networks.
Sign-in/Register to access full text options 
Free) 
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 call
