Independence Saturation and Strong Independent Saturation in Probabilistic Neural Networks

BERBERLER Z. N.

New Mathematics and Natural Computation, cilt.21, sa.1, ss.213-227, 2025 (ESCI) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 21 Sayı: 1
  • Basım Tarihi: 2025
  • Doi Numarası: 10.1142/s1793005725500127
  • Dergi Adı: New Mathematics and Natural Computation
  • Derginin Tarandığı İndeksler: Emerging Sources Citation Index (ESCI), Scopus, Academic Search Premier, Aerospace Database, Communication Abstracts, Metadex, zbMATH, Civil Engineering Abstracts
  • Sayfa Sayıları: ss.213-227
  • Anahtar Kelimeler: domination, Independence, independence saturation, network design and communication, probabilistic neural networks, strong domination, strong independent saturation
  • Dokuz Eylül Üniversitesi Adresli: Evet

Özet

The independence saturation number IS(G) of a graph G = (V,E) is defined as min{IS(v): v V}, where IS(v) is the maximum cardinality of an independent set that contains v. The strong independent saturation number Is(G) of a graph G = (V,E) is defined as min{Is(v): v ∈ V}, where Is(v) is the maximum cardinality of a minimal strong independent dominating set of G that contains v. This paper is devoted to the computation of independence saturation and strong independent saturation numbers of 3- and 4-layered probabilistic neural networks.