Independence Saturation and Strong Independent Saturation in Probabilistic Neural Networks

Zeynep Nihan Berberler ()
Additional contact information
Zeynep Nihan Berberler: Faculty of Science, Department of Computer Science, Dokuz Eylul University, 35160 Izmir, Turkey

New Mathematics and Natural Computation (NMNC), 2025, vol. 21, issue 01, 213-227

Abstract: 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.

Keywords: Independence; domination; strong domination; independence saturation; strong independent saturation; probabilistic neural networks; network design and communication (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S1793005725500127
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:nmncxx:v:21:y:2025:i:01:n:s1793005725500127

Ordering information: This journal article can be ordered from

DOI: 10.1142/S1793005725500127

Access Statistics for this article

New Mathematics and Natural Computation (NMNC) is currently edited by Paul P Wang

More articles in New Mathematics and Natural Computation (NMNC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().