INDEPENDENTLY SATURATED GRAPHS

Berberler Z. N., Berberler M. E.

TWMS JOURNAL OF APPLIED AND ENGINEERING MATHEMATICS, vol.8, no.1, pp.44-50, 2018 (ESCI) identifier identifier

  • Publication Type: Article / Article
  • Volume: 8 Issue: 1
  • Publication Date: 2018
  • Journal Name: TWMS JOURNAL OF APPLIED AND ENGINEERING MATHEMATICS
  • Journal Indexes: Emerging Sources Citation Index (ESCI), Scopus, TR DİZİN (ULAKBİM)
  • Page Numbers: pp.44-50
  • Keywords: Independence, Independence saturation, Graph theory
  • Dokuz Eylül University Affiliated: Yes

Abstract

independence saturation number I S (G) of a graph G = (V, E) is defined as min {I S (V) : v is an element of 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.