Independence Saturation and Strong Independent Saturation in Probabilistic Neural Networks
-
Published:2024-01-03
Issue:
Volume:
Page:1-15
-
ISSN:1793-0057
-
Container-title:New Mathematics and Natural Computation
-
language:en
-
Short-container-title:New Math. and Nat. Computation
Author:
Berberler Zeynep Nihan1ORCID
Affiliation:
1. Faculty of Science, Department of Computer Science, Dokuz Eylul University, 35160 Izmir, Turkey
Abstract
The independence saturation number [Formula: see text] of a graph [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the maximum cardinality of an independent set that contains [Formula: see text]. The strong independent saturation number [Formula: see text] of a graph [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the maximum cardinality of a minimal strong independent dominating set of [Formula: see text] that contains [Formula: see text]. This paper is devoted to the computation of independence saturation and strong independent saturation numbers of 3- and 4-layered probabilistic neural networks.
Publisher
World Scientific Pub Co Pte Ltd
Subject
Applied Mathematics,Computational Theory and Mathematics,Computational Mathematics,Computer Science Applications,Human-Computer Interaction