{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T03:11:58Z","timestamp":1648869118633},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2019,10]]},"abstract":"<jats:p> In a graph [Formula: see text], a 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]. The open packing bondage number of a graph [Formula: see text], denoted by [Formula: see text], is the cardinality of the smallest set of edges [Formula: see text] such that [Formula: see text]. In this paper, we initiate a study on this parameter. <\/jats:p>","DOI":"10.1142\/s1793830919500514","type":"journal-article","created":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T02:10:41Z","timestamp":1565662241000},"page":"1950051","source":"Crossref","is-referenced-by-count":0,"title":["Open packing bondage number of a graph"],"prefix":"10.1142","volume":"11","author":[{"given":"S.","family":"Saravanakumar","sequence":"first","affiliation":[{"name":"Department of Mathematics, Kalasalingam Academy of Research and Education, Krishnankoil, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Anitha","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Thiagarajar College of Engineering, Madurai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"Sahul Hamid","sequence":"additional","affiliation":[{"name":"Department of Mathematics, The Madura College, Madurai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2019,11,3]]},"reference":[{"key":"S1793830919500514BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(83)90085-7"},{"key":"S1793830919500514BIB002","volume-title":"Graphs and Digraphs","author":"Chartrand G.","year":"2005","edition":"4"},{"key":"S1793830919500514BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90348-L"},{"key":"S1793830919500514BIB004","doi-asserted-by":"publisher","DOI":"10.1080\/16073606.1998.9632043"},{"key":"S1793830919500514BIB005","first-page":"3","volume":"29","author":"Henning M. A.","year":"1999","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"S1793830919500514BIB006","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1975.61.225"},{"key":"S1793830919500514BIB007","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/595210"},{"key":"S1793830919500514BIB008","first-page":"1487","volume":"5","author":"Ebadi K.","year":"2010","journal-title":"Int. J. Contemp. Math. Sci."},{"key":"S1793830919500514BIB009","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1775"},{"key":"S1793830919500514BIB010","doi-asserted-by":"publisher","DOI":"10.5666\/KMJ.2016.56.3.745"},{"key":"S1793830919500514BIB011","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830916500166"},{"issue":"1","key":"S1793830919500514BIB012","first-page":"107","volume":"12","author":"Sahul Hamid I.","year":"2017","journal-title":"Iran. J. Math. Sci. Inform."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830919500514","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,4]],"date-time":"2019-11-04T06:15:03Z","timestamp":1572848103000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830919500514"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10]]},"references-count":12,"journal-issue":{"issue":"05","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["10.1142\/S1793830919500514"],"URL":"https:\/\/doi.org\/10.1142\/s1793830919500514","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10]]}}}