Makale detayı · 2025 · article
Independence Saturation and Strong Independent Saturation in Probabilistic Neural Networks
Veri kaynağı ayrımı
- YÖKSİSYÖKSİS makale kaydı
- YÖKSİS dergi adıNew Mathematics and Natural Computation
- Katalog eşleşmesi (ISSN)New Mathematics and Natural Computation
- OpenAlexOpenAlex zenginleştirmesi (özet, atıf, konular)
- Semantic Scholaratıf sayısı (OpenAlex ile birleştirilmez)
Özet
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.
Konular
Atıflar
OpenAlex cited_by_count. WoS veya Scopus atıf sayısı değildir; o kaynaklar için ayrı kolon yoktur.
1atıfOpenAlex · cited_by_count (önbellek / veritabanı)