{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T02:31:09Z","timestamp":1747189869978,"version":"3.40.5"},"reference-count":24,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["New Math. and Nat. Computation"],"published-print":{"date-parts":[[2025,3]]},"abstract":"<jats:p> 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. <\/jats:p>","DOI":"10.1142\/s1793005725500127","type":"journal-article","created":{"date-parts":[[2023,12,18]],"date-time":"2023-12-18T07:06:47Z","timestamp":1702883207000},"page":"213-227","source":"Crossref","is-referenced-by-count":0,"title":["Independence Saturation and Strong Independent Saturation in Probabilistic Neural Networks"],"prefix":"10.1142","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9179-3648","authenticated-orcid":false,"given":"Zeynep Nihan","family":"Berberler","sequence":"first","affiliation":[{"name":"Faculty of Science, Department of Computer Science, Dokuz Eylul University, 35160 Izmir, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2024,1,3]]},"reference":[{"issue":"3","key":"S1793005725500127BIB001","first-page":"153","volume":"4","author":"Ayta\u00e7 A.","year":"2019","journal-title":"Journal of Modern Technology and Engineering"},{"key":"S1793005725500127BIB002","doi-asserted-by":"publisher","DOI":"10.1007\/BF01069014"},{"key":"S1793005725500127BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.aej.2022.11.001"},{"key":"S1793005725500127BIB004","doi-asserted-by":"publisher","DOI":"10.1515\/dema-2022-0183"},{"key":"S1793005725500127BIB005","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2005.10129105"},{"volume-title":"Introduction to Graph Theory","year":"2001","author":"West D. B.","key":"S1793005725500127BIB006"},{"key":"S1793005725500127BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(90)90049-Q"},{"key":"S1793005725500127BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(95)00231-K"},{"key":"S1793005725500127BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2005.12.010"},{"key":"S1793005725500127BIB010","doi-asserted-by":"publisher","DOI":"10.3109\/10826089809115869"},{"key":"S1793005725500127BIB011","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3023-4_1"},{"key":"S1793005725500127BIB012","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-006-0045-4"},{"key":"S1793005725500127BIB013","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-017-2972-1"},{"key":"S1793005725500127BIB015","doi-asserted-by":"publisher","DOI":"10.26708\/IJMSC.2013.2.3.08"},{"key":"S1793005725500127BIB016","doi-asserted-by":"publisher","DOI":"10.1142\/S0217979223501795"},{"issue":"2","key":"S1793005725500127BIB017","first-page":"171","volume":"4","author":"Arumugam S.","year":"2007","journal-title":"AKCE International Journal of Graphs and Combinatorics"},{"key":"S1793005725500127BIB018","doi-asserted-by":"publisher","DOI":"10.1142\/S0218348X20400101"},{"key":"S1793005725500127BIB019","doi-asserted-by":"publisher","DOI":"10.1142\/S0218348X20400071"},{"issue":"1","key":"S1793005725500127BIB020","first-page":"11","volume":"86","author":"Muthulakshmi T.","year":"2014","journal-title":"Far East Journal of Mathematical Sciences"},{"volume-title":"Domination in Graphs: Advanced Topics","year":"1998","author":"Haynes T. W.","key":"S1793005725500127BIB021"},{"volume-title":"Fundamentals of Domination in Graphs","year":"1998","author":"Haynes T. W.","key":"S1793005725500127BIB022"},{"issue":"1","key":"S1793005725500127BIB023","first-page":"44","volume":"8","author":"Berberler Z. N.","year":"2018","journal-title":"TWMS Journal of Applied and Engineering Mathematics"},{"issue":"2","key":"S1793005725500127BIB024","first-page":"325","volume":"13","author":"Berberler Z. N.","year":"2017","journal-title":"Celal Bayar University Journal of Science"},{"key":"S1793005725500127BIB025","doi-asserted-by":"publisher","DOI":"10.36753\/mathenot.421776"}],"container-title":["New Mathematics and Natural Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793005725500127","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T02:02:30Z","timestamp":1741053750000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793005725500127"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,3]]},"references-count":24,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["10.1142\/S1793005725500127"],"URL":"https:\/\/doi.org\/10.1142\/s1793005725500127","relation":{},"ISSN":["1793-0057","1793-7027"],"issn-type":[{"type":"print","value":"1793-0057"},{"type":"electronic","value":"1793-7027"}],"subject":[],"published":{"date-parts":[[2024,1,3]]}}}