Irredundance saturation number of a graph.
S. Arumugam, Odile Favaron, S. Sudha · 2010
Let G =(V,E) be a graph and let v ∈ V. Let IRS(v, G) denote the maximum cardinality of an irredundant set in G which contains v. Then IRS(G) = min{IRS(v, G):v ∈ V} is called the irredundance saturation number of G. In this paper we initiate a study of this parameter.