Dergiler / TWMS Journal of Applied and Engineering Mathematics / 2018 / Cilt: 8 - Sayı: 1

INDEPENDENTLY SATURATED GRAPHS

Z.n. BERBERLER, M.e. BERBERLER

Sayfa
44–50
DOI
—

Abstract

The independence saturation number IS G of a graph G = V;E is dened 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 specic graph families and composite graphs.