The independence saturation number IS G of a graph G = V;E is de ned as minfIS V : v 2 V g , where IS v is the maximum cardinality of an independent set that contains v. In this paper, we consider and compute exact formulae for the independence saturation in speci c graph families and composite graphs.
Journal Type : Ulusal
Relevant Articles | Author | # |
---|
Article | Author | # |
---|