Title of article
INDEPENDENTLY SATURATED GRAPHS
Author/Authors
BERBERLER, Z.N Faculty of Science - Department of Computer Science - Dokuz Eylul University - Izmir,Turkey , BERBERLER, M.E Faculty of Science - Department of Computer Science - Dokuz Eylul University - Izmir,Turkey
Pages
7
From page
44
To page
50
Abstract
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.
Keywords
Independence , Independence saturation , Graph theory
Journal title
Turkish World Mathematical Society Journal of Applied and Engineering Mathematics
Serial Year
2018
Record number
2581681
Link To Document