{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T02:30:02Z","timestamp":1747189802841,"version":"3.40.5"},"reference-count":3,"publisher":"World Scientific Pub Co Pte Ltd","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2020,12]]},"abstract":"<jats:p> Let [Formula: see text] be a simple graph of order [Formula: see text]. The strong nonsplit domination polynomial of a graph [Formula: see text] is [Formula: see text] where [Formula: see text] is the number of strong nonsplit dominating sets of [Formula: see text] of size [Formula: see text] and [Formula: see text] is the strong nonsplit domination number of [Formula: see text]. Let [Formula: see text] be the family of strong nonsplit dominating sets of a complement of a path [Formula: see text] ([Formula: see text]) with cardinality [Formula: see text], and let [Formula: see text]. In this paper, we construct [Formula: see text], the recursive formula for [Formula: see text] and [Formula: see text], the strong nonsplit domination polynomial of [Formula: see text]. Also, we obtain some properties of the coefficients of this polynomial. <\/jats:p>","DOI":"10.1142\/s1793830920500822","type":"journal-article","created":{"date-parts":[[2020,6,24]],"date-time":"2020-06-24T06:12:00Z","timestamp":1592979120000},"page":"2050082","source":"Crossref","is-referenced-by-count":1,"title":["Strong nonsplit dominating sets and strong nonsplit domination polynomial of complement of paths"],"prefix":"10.1142","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5538-2750","authenticated-orcid":false,"given":"D.","family":"Kiruba Packiarani","sequence":"first","affiliation":[{"name":"PG and Research Department of Mathematics, St. Xavier\u2019s College (Autonomous), Palayamkottai 627 002, Tamil Nadu, India"},{"name":"Affiliated to Manonmaniam Sundaranar University, Abishekapatti, Tirunelveli 627 012, Tamil Nadu, India"}]},{"given":"Y.","family":"Therese Sunitha Mary","sequence":"additional","affiliation":[{"name":"PG and Research Department of Mathematics, St. Xavier\u2019s College (Autonomous), Palayamkottai 627 002, Tamil Nadu, India"},{"name":"Affiliated to Manonmaniam Sundaranar University, Abishekapatti, Tirunelveli 627 012, Tamil Nadu, India"}]}],"member":"219","published-online":{"date-parts":[[2020,8,24]]},"reference":[{"key":"S1793830920500822BIB002","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"Harary F.","year":"1969"},{"volume-title":"Domination in Graphs \u2014 Advanced Topics","year":"1998","author":"Haynes T. W.","key":"S1793830920500822BIB003"},{"key":"S1793830920500822BIB005","first-page":"145","volume":"19","author":"Kulli V. R.","year":"2003","journal-title":"Int. J. Manag. Syst."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830920500822","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,29]],"date-time":"2020-11-29T05:01:24Z","timestamp":1606626084000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830920500822"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,24]]},"references-count":3,"journal-issue":{"issue":"06","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["10.1142\/S1793830920500822"],"URL":"https:\/\/doi.org\/10.1142\/s1793830920500822","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2020,8,24]]}}}