{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:44:27Z","timestamp":1753883067874,"version":"3.41.2"},"reference-count":6,"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":[[2021,12]]},"abstract":"<jats:p> Let [Formula: see text] be a simple finite and connected graph. A dominating set [Formula: see text] is a strong nonsplit dominating set if the induced subgraph [Formula: see text] is complete. [Formula: see text] is an inverse strong nonsplit dominating set if [Formula: see text] is a strong nonsplit dominating set of [Formula: see text]. The cardinality of minimum inverse strong nonsplit dominating set is the inverse strong nonsplit domination number [Formula: see text]. In this paper, we initiated and introduced a new variant of strong nonsplit dominating set called inverse strong nonsplit dominating set. Also, we obtain the inverse strong nonsplit domination number and bounds of some standard graphs and its complement. <\/jats:p>","DOI":"10.1142\/s1793830921500725","type":"journal-article","created":{"date-parts":[[2020,12,14]],"date-time":"2020-12-14T07:15:10Z","timestamp":1607930110000},"source":"Crossref","is-referenced-by-count":0,"title":["The inverse strong nonsplit domination in graphs"],"prefix":"10.1142","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5538-2750","authenticated-orcid":false,"given":"D. Kiruba","family":"Packiarani","sequence":"first","affiliation":[{"name":"PG and Research Department of Mathematics, St. Xavier\u2019s College (Autonomous), Palayamkottai 627 002, Affiliated to Manonmaniam Sundaranar University, Abishekapati, Tirunelveli 627 012, Tamil Nadu, India"}]},{"given":"Y. Therese Sunitha","family":"Mary","sequence":"additional","affiliation":[{"name":"PG and Research Department of Mathematics, St. Xavier\u2019s College (Autonomous), Palayamkottai 627 002, Affiliated to Manonmaniam Sundaranar University, Abishekapati, Tirunelveli 627 012, Tamil Nadu, India"}]}],"member":"219","published-online":{"date-parts":[[2021,1,9]]},"reference":[{"key":"S1793830921500725BIB001","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364"},{"volume-title":"Domination in Graphs \u2014 Advanced Topics","year":"1998","author":"Haynes T. W.","key":"S1793830921500725BIB002"},{"key":"S1793830921500725BIB003","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830920500536"},{"key":"S1793830921500725BIB004","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830920500822"},{"key":"S1793830921500725BIB005","first-page":"145","volume":"19","author":"Kulli V. R.","year":"2003","journal-title":"Int. J. Management Syst."},{"key":"S1793830921500725BIB006","first-page":"473","volume":"14","author":"Kulli V. R.","year":"1991","journal-title":"Nat. Acad. Sci. Lett."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830921500725","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,8]],"date-time":"2021-12-08T11:34:59Z","timestamp":1638963299000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830921500725"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,9]]},"references-count":6,"journal-issue":{"issue":"06","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["10.1142\/S1793830921500725"],"URL":"https:\/\/doi.org\/10.1142\/s1793830921500725","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2021,1,9]]},"article-number":"2150072"}}