INDEPENDENTLY SATURATED GRAPHS

---

Atıf İçin Kopyala

BERBERLER Z. N., BERBERLER M. E.

Turkish World Mathematical Society Journal of Applied and Engineering Mathematics, cilt.8, sa.1, ss.44-50, 2018 (ESCI)

• Yayın Türü: Makale / Tam Makale
• Cilt numarası: 8 Sayı: 1
• Basım Tarihi: 2018
• Dergi Adı: Turkish World Mathematical Society 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
• 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.