INDEPENDENTLY SATURATED GRAPHS

Year 2018, Volume: 8 Issue: 1, 44 - 50, 01.06.2018

Z.n. Berberler M.e. Berberler

Abstract

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

Keywords

Independence , Independence saturation , Graph theory

References

• Korshunov, A. D.,(1974), Coefficient of internal stability of graphs, Cybernetics 10 (1) pp. 19-33.
• West, D.B., (2001), Introduction to Graph Theory, Prentice Hall, NJ.
• 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.
• Subramanian, M., (2004), Studies in Graph Theory-Independence saturation in Graphs, Ph.D thesis, Manonmaniam Sundaranar University.
• Arumugam, S., Subramanian, M., (2007), Independence saturation and extended domination chain in graphs, AKCE J. Graphs. Combin. 4(2) pp. 5969.
• Muthulakshmi, T., Subramanian, M., (2014), Independence saturation number of some classes of graphs, Far East Journal of Mathematical Sciences 86(1) pp. 11-21.