The independence saturation number IS(G) of a graph G = (V, E) is defined as min{IS(V ) : v ∈ V } , where IS(v) is the maximum cardinality of an independent set that contains v. In this paper, we consider and compute exact ...