{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T22:31:07Z","timestamp":1726439467714},"reference-count":5,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2016,3]]},"abstract":"<jats:p> In a graph [Formula: see text], a nonempty set [Formula: see text] is said to be an open packing set if no two vertices of [Formula: see text] have a common neighbor in [Formula: see text] The maximum cardinality of an open packing set is called the open packing number and is denoted by [Formula: see text]. In this paper, we examine the effect of [Formula: see text] when [Formula: see text] is modified by deleting an edge. <\/jats:p>","DOI":"10.1142\/s1793830916500166","type":"journal-article","created":{"date-parts":[[2015,12,15]],"date-time":"2015-12-15T02:34:52Z","timestamp":1450146892000},"page":"1650016","source":"Crossref","is-referenced-by-count":2,"title":["Changing and unchanging Open Packing: Edge removal"],"prefix":"10.1142","volume":"08","author":[{"given":"I. Sahul","family":"Hamid","sequence":"first","affiliation":[{"name":"Department of Mathematics, The Madura College (Autonomous), Madurai 625 011, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Saravanakumar","sequence":"additional","affiliation":[{"name":"Department of Mathematics, The Madura College (Autonomous), Madurai 625 011, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2016,2,26]]},"reference":[{"key":"S1793830916500166BIB001","volume-title":"Graphs and Digraphs","author":"Chartrand G.","year":"2005","edition":"4"},{"volume-title":"Fundamentals of Domination in Graphs","year":"1998","author":"Haynes T. W.","key":"S1793830916500166BIB002"},{"key":"S1793830916500166BIB003","doi-asserted-by":"publisher","DOI":"10.1080\/16073606.1998.9632043"},{"key":"S1793830916500166BIB004","first-page":"3","volume":"29","author":"Henning M. A.","year":"1999","journal-title":"JCMCC"},{"key":"S1793830916500166BIB006","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1775"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830916500166","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:02:44Z","timestamp":1565121764000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830916500166"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,26]]},"references-count":5,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2016,2,26]]},"published-print":{"date-parts":[[2016,3]]}},"alternative-id":["10.1142\/S1793830916500166"],"URL":"https:\/\/doi.org\/10.1142\/s1793830916500166","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2016,2,26]]}}}