{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T13:26:58Z","timestamp":1748870818133},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2017,2]]},"abstract":"<jats:p> A set of [Formula: see text] of vertices in a graph [Formula: see text] is called a dominating set if every vertex of [Formula: see text] is adjacent to an element of [Formula: see text]. Further, if [Formula: see text] has an isolated vertex, then [Formula: see text] is called an isolate dominating set. The minimum cardinality of an isolate dominating set of a graph [Formula: see text] is called the isolate domination number, denoted by [Formula: see text]. This paper examines the effects of removal of an edge on the isolate domination number of a graph. <\/jats:p>","DOI":"10.1142\/s1793830917500033","type":"journal-article","created":{"date-parts":[[2016,10,19]],"date-time":"2016-10-19T06:09:59Z","timestamp":1476857399000},"page":"1750003","source":"Crossref","is-referenced-by-count":4,"title":["Changing and unchanging isolate domination: Edge removal"],"prefix":"10.1142","volume":"09","author":[{"given":"S.","family":"Balamurugan","sequence":"first","affiliation":[{"name":"PG and Research Department of Mathematics, St. Xavier\u2019s College, Palayamkottai, India"}]}],"member":"219","published-online":{"date-parts":[[2017,2,6]]},"reference":[{"key":"S1793830917500033BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(83)90085-7"},{"key":"S1793830917500033BIB003","volume-title":"Introduction to Graph Theory","author":"Chartrand G.","year":"2006"},{"key":"S1793830917500033BIB004","volume-title":"Domination in Graphs: advanced topics","author":"Haynes T. W.","year":"1998"},{"key":"S1793830917500033BIB005","volume-title":"Fundamentals of domination in Graphs","author":"Haynes T. W.","year":"1998"},{"issue":"2","key":"S1793830917500033BIB006","first-page":"10","volume":"7","author":"Hamid I. Sahul","year":"2015","journal-title":"Discrete Math. Algorithms Appl."},{"key":"S1793830917500033BIB007","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/792743"},{"key":"S1793830917500033BIB008","first-page":"127","volume":"3","author":"Hamid I. Sahul","year":"2013","journal-title":"Bull. Int. Math. Virtual Inst."},{"key":"S1793830917500033BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.ajmsc.2015.10.001"},{"issue":"3","key":"S1793830917500033BIB010","doi-asserted-by":"crossref","first-page":"79","DOI":"10.26708\/IJMSC.2013.3.3.11","volume":"3","author":"Hamid I. Sahul","year":"2013","journal-title":"Int. J. Math. Soft Comput."},{"key":"S1793830917500033BIB011","first-page":"70","volume":"2","author":"Walikar H. B.","year":"1979","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\/S1793830917500033","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T09:04:47Z","timestamp":1565082287000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830917500033"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2]]},"references-count":10,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2017,2,6]]},"published-print":{"date-parts":[[2017,2]]}},"alternative-id":["10.1142\/S1793830917500033"],"URL":"https:\/\/doi.org\/10.1142\/s1793830917500033","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2]]}}}