INDEPENDENTLY SATURATED GRAPHS

Berberler Z. N., Berberler M. E.

TWMS JOURNAL OF APPLIED AND ENGINEERING MATHEMATICS, cilt.8, sa.1, ss.44-50, 2018 (ESCI) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 8 Sayı: 1
  • Basım Tarihi: 2018
  • Dergi Adı: TWMS JOURNAL OF APPLIED AND ENGINEERING MATHEMATICS
  • Derginin Tarandığı İndeksler: Emerging Sources Citation Index (ESCI), Scopus, TR DİZİN (ULAKBİM)
  • Sayfa Sayıları: ss.44-50
  • Anahtar Kelimeler: Independence, Independence saturation, Graph theory
  • Dokuz Eylül Üniversitesi Adresli: Evet

Özet

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.