{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:24:18Z","timestamp":1753885458796,"version":"3.41.2"},"reference-count":16,"publisher":"World Scientific Pub Co Pte Ltd","issue":"08","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2023,11]]},"abstract":"<jats:p> A nonempty set [Formula: see text] of a graph [Formula: see text] is an open packing set of [Formula: see text] 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 of [Formula: see text] and is denoted by [Formula: see text]. The open packing subdivision number\u00a0[Formula: see text] is the minimum number of edges in [Formula: see text] that must be subdivided (each edge in [Formula: see text] can be subdivided at most once) in order to increase the open packing number. In this paper, we initiate a study on this parameter. <\/jats:p>","DOI":"10.1142\/s1793830922501774","type":"journal-article","created":{"date-parts":[[2022,12,9]],"date-time":"2022-12-09T05:01:40Z","timestamp":1670562100000},"source":"Crossref","is-referenced-by-count":0,"title":["Open packing subdivision number of graphs"],"prefix":"10.1142","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0302-6906","authenticated-orcid":false,"given":"C.","family":"Gayathri","sequence":"first","affiliation":[{"name":"Department of Mathematics, Kalasalingam Academy of Research and Education, Krishnankoil 626126, Tamil Nadu, India"}]},{"given":"K.","family":"Karuppasamy","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Kalasalingam Academy of Research and Education, Krishnankoil 626126, Tamil Nadu, India"}]},{"given":"S.","family":"Saravanakumar","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Thiagarajar College of Engineering, Madurai 625015, Tamil Nadu, India"}]}],"member":"219","published-online":{"date-parts":[[2022,12,8]]},"reference":[{"key":"S1793830922501774BIB001","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1016\/j.disc.2007.12.085","volume":"309","author":"Aram H.","year":"2009","journal-title":"Discrete Math."},{"key":"S1793830922501774BIB002","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s00010-009-2981-y","volume":"78","author":"Atapour M.","year":"2009","journal-title":"Aequ. Math."},{"key":"S1793830922501774BIB003","doi-asserted-by":"crossref","first-page":"335","DOI":"10.7151\/dmgt.1179","volume":"22","author":"Bhattacharya A.","year":"2002","journal-title":"Discuss. Math. Graph Theory"},{"key":"S1793830922501774BIB004","volume-title":"Graphs and Digraphs","author":"Chartrand G.","year":"2016","edition":"6"},{"key":"S1793830922501774BIB005","doi-asserted-by":"crossref","first-page":"5","DOI":"10.7151\/dmgt.1775","volume":"35","author":"Hamid I. S.","year":"2015","journal-title":"Discuss. Math. Graph Theory"},{"key":"S1793830922501774BIB006","doi-asserted-by":"crossref","first-page":"1650016","DOI":"10.1142\/S1793830916500166","volume":"8","author":"Hamid I. S.","year":"2016","journal-title":"Discrete Math. Algorithms Appl."},{"key":"S1793830922501774BIB007","doi-asserted-by":"crossref","first-page":"245","DOI":"10.5666\/KMJ.2016.56.3.745","volume":"56","author":"Hamid I. S.","year":"2016","journal-title":"Kyungpook Math. J."},{"key":"S1793830922501774BIB008","first-page":"107","volume":"12","author":"Hamid I. S.","year":"2017","journal-title":"Iran. J. Math. Sci. Inform."},{"key":"S1793830922501774BIB009","doi-asserted-by":"crossref","first-page":"271","DOI":"10.7151\/dmgt.1126","volume":"20","author":"Haynes T. W.","year":"2000","journal-title":"Discuss. Math. Graph Theory"},{"key":"S1793830922501774BIB010","first-page":"115","volume":"44","author":"Haynes T. W.","year":"2003","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"S1793830922501774BIB011","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/j.disc.2004.06.004","volume":"286","author":"Haynes T. W.","year":"2004","journal-title":"Discrete Math."},{"key":"S1793830922501774BIB012","first-page":"3","volume":"29","author":"Henning M. A.","year":"1999","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"S1793830922501774BIB013","first-page":"105","volume":"7","author":"Meddah N.","year":"2022","journal-title":"Commun. Comb. Optim."},{"key":"S1793830922501774BIB014","doi-asserted-by":"crossref","first-page":"225","DOI":"10.2140\/pjm.1975.61.225","volume":"61","author":"Meir A.","year":"1975","journal-title":"Pacific J. Math."},{"key":"S1793830922501774BIB015","doi-asserted-by":"crossref","first-page":"35","DOI":"10.7151\/dmgt.1257","volume":"25","author":"Rall D. F.","year":"2005","journal-title":"Discuss. Math. Graph Theory"},{"key":"S1793830922501774BIB016","doi-asserted-by":"crossref","first-page":"1950036","DOI":"10.1142\/S1793830919500368","volume":"11","author":"Rashmi S. V. D.","year":"2019","journal-title":"Discrete Math. Algorithms Appl."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830922501774","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,15]],"date-time":"2023-08-15T02:56:08Z","timestamp":1692068168000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830922501774"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,8]]},"references-count":16,"journal-issue":{"issue":"08","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["10.1142\/S1793830922501774"],"URL":"https:\/\/doi.org\/10.1142\/s1793830922501774","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2022,12,8]]},"article-number":"2250177"}}