TWMS JOURNAL OF APPLIED AND ENGINEERING MATHEMATICS, cilt.8, sa.1, ss.44-50, 2018 (ESCI)
independence saturation number I S (G) of a graph G = (V, E) is defined as min {I S (V) : v is an element of V}, 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 specific graph families and composite graphs.