TY  - JOUR
T1  - INDEPENDENTLY SATURATED GRAPHS
AU  - Berberler, Z.n.
AU  - Berberler, M.e.
PY  - 2018
DA  - June
JF  - TWMS Journal of Applied and Engineering Mathematics
JO  - JAEM
PB  - Işık University Press
WT  - DergiPark
SN  - 2146-1147
SP  - 44
EP  - 50
VL  - 8
IS  - 1
LA  - en
AB  - 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.
KW  - Independence
KW  - Independence saturation
KW  - Graph theory
CR  - Korshunov, A. D.,(1974), Coefficient of internal stability of graphs, Cybernetics 10 (1) pp. 19-33.
CR  - West, D.B., (2001), Introduction to Graph Theory, Prentice Hall, NJ.
CR  - Bomze, I., Budinich, M., Pardalos, P., Pelillo, M., (1999), The maximum clique problem, in D. Du and P. Pardalos (eds), Handbook of Combinatorial Optimization, Supplement Volume A, Kluwer Academic Press.
CR  - Subramanian, M., (2004), Studies in Graph Theory-Independence saturation in Graphs, Ph.D thesis, Manonmaniam Sundaranar University.
CR  - Arumugam, S., Subramanian, M., (2007), Independence saturation and extended domination chain in graphs, AKCE J. Graphs. Combin. 4(2) pp. 5969.
CR  - Muthulakshmi, T., Subramanian, M., (2014), Independence saturation number of some classes of graphs, Far East Journal of Mathematical Sciences 86(1) pp. 11-21.
UR  - https://dergipark.org.tr/en/pub/twmsjaem/issue//761140
L1  - https://dergipark.org.tr/en/download/article-file/1179284
ER  -