{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:16:44Z","timestamp":1753885004759,"version":"3.41.2"},"reference-count":9,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","funder":[{"name":"University Grand Commission, India","award":["995\/(CSIR-UGC NET JUNE 2018)"],"award-info":[{"award-number":["995\/(CSIR-UGC NET JUNE 2018)"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2025,9]]},"abstract":"<jats:p> Any network can be modeled by a connected graph [Formula: see text], where [Formula: see text] is the set of nodes and [Formula: see text] is the set of direct communication links between the nodes. Many graph theoretical parameters are helpful in the study of the efficiency and reliability of an interconnection network model. A dominating set [Formula: see text] is a co-secure dominating set if, for each [Formula: see text], there exists [Formula: see text] such that [Formula: see text] is adjacent to [Formula: see text] and [Formula: see text] is a dominating set. The minimum cardinality of a co-secure dominating set in [Formula: see text] is called the co-secure domination number [Formula: see text] of [Formula: see text]. The study of a co-secure dominating set is essential in interconnection networks as it studies the security in it. Sierpi\u0144ski graphs and generalized Sierpi\u0144ski graphs are one among the well-known networks. Applications for Sierpi\u0144ski graphs may be found in many fields, such as computer science, chemistry, psychology, probability, and dynamic systems. Sierpi\u0144ski graphs are explored in fractal theory. Generalized Sierpi\u0144ski graphs may be used to represent polymer networks and [Formula: see text] recursive networks. In this paper, we have obtained an upper bound for the co-secure domination number of the generalized Sierpi\u0144ski graph of paths, and we have proved that this bound is sharp. <\/jats:p>","DOI":"10.1142\/s0219265924500233","type":"journal-article","created":{"date-parts":[[2024,11,30]],"date-time":"2024-11-30T15:08:14Z","timestamp":1732979294000},"source":"Crossref","is-referenced-by-count":0,"title":["Co-Secure Domination in Generalized Sierpi\u0144ski Graph of Paths"],"prefix":"10.1142","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7048-0295","authenticated-orcid":false,"given":"Gisha","family":"Saraswathy","sequence":"first","affiliation":[{"name":"Department of Mathematics, Maharaja\u2019s College, Ernakulam 682011, Kerala, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5692-825X","authenticated-orcid":false,"given":"Manju K.","family":"Menon","sequence":"additional","affiliation":[{"name":"Department of Mathematics, St. Paul\u2019s College, Kalamassery, Ernakulam 683503, Kerala, India"}]}],"member":"219","published-online":{"date-parts":[[2024,11,30]]},"reference":[{"key":"S0219265924500233BIB001","first-page":"167","volume":"94","author":"Arumugam S.","year":"2014","journal-title":"Util. Math."},{"key":"S0219265924500233BIB002","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-4529-6"},{"issue":"2","key":"S0219265924500233BIB003","first-page":"573","volume":"53","author":"Gisha S.","year":"2023","journal-title":"IAENG Int. J. Appl. Math."},{"key":"S0219265924500233BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2016.09.024"},{"key":"S0219265924500233BIB007","volume":"37","author":"Javaid I.","year":"2019","journal-title":"J. Inequal. Appl."},{"key":"S0219265924500233BIB008","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022444205860"},{"key":"S0219265924500233BIB009","first-page":"343","volume":"27","author":"Milutinovi\u0107 U.","year":"1992","journal-title":"Glasnik Matematicki Series III"},{"key":"S0219265924500233BIB010","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1945"},{"key":"S0219265924500233BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2022.01.013"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265924500233","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:24:39Z","timestamp":1746059079000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0219265924500233"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,30]]},"references-count":9,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["10.1142\/S0219265924500233"],"URL":"https:\/\/doi.org\/10.1142\/s0219265924500233","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"type":"print","value":"0219-2659"},{"type":"electronic","value":"1793-6713"}],"subject":[],"published":{"date-parts":[[2024,11,30]]},"article-number":"2450023"}}