SavedAdd your journal

Journals / TWMS (Turkic World Mathematical Society) Journal of Applied and Engineering Mathematics / 2018 / Cilt: 8 - Sayı: 1

INDEPENDENTLY SATURATED GRAPHS

Z.N. BERBERLER,M.E. BERBERLER

Pages
44–50
DOI
—

Özet

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 formulae for the independence saturation in specific graph families and composite graphs.