{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:16:07Z","timestamp":1753884967540,"version":"3.41.2"},"reference-count":16,"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":[[2023,8]]},"abstract":"<jats:p> For a graph [Formula: see text], a double Roman dominating function (DRDF) is a function [Formula: see text] such that each vertex [Formula: see text] with [Formula: see text] is adjacent to at least two vertices labeled [Formula: see text] or one vertex labeled [Formula: see text] and each vertex [Formula: see text] with [Formula: see text] is adjacent to at least one vertex [Formula: see text] with [Formula: see text]. The weight of [Formula: see text] is the sum of all labelings [Formula: see text] and is denoted by [Formula: see text]. If [Formula: see text] is a DRDF on [Formula: see text] with minimum weight [Formula: see text], then its inverse double Roman dominating function (IDRDF) [Formula: see text] is a DRDF on [Formula: see text], such that [Formula: see text], where [Formula: see text]. The inverse double Roman domination number (IDRDN) of [Formula: see text], denoted by [Formula: see text] is the minimum weight of such a function. We introduce this new type of inverse dominating function, obtain some bounds for the IDRDN of [Formula: see text]. We characterize the graphs having [Formula: see text] and the highest. We also present an approach for constructing graphs with the desired IDRDN. <\/jats:p>","DOI":"10.1142\/s1793830922501440","type":"journal-article","created":{"date-parts":[[2022,9,23]],"date-time":"2022-09-23T03:57:27Z","timestamp":1663905447000},"source":"Crossref","is-referenced-by-count":4,"title":["Inverse double Roman domination in graphs"],"prefix":"10.1142","volume":"15","author":[{"given":"Wilma Laveena","family":"D\u2019 Souza","sequence":"first","affiliation":[{"name":"Department of Mathematics, St. Joseph\u2019s University, Bengaluru 560 027, India"}]},{"given":"V.","family":"Chaitra","sequence":"additional","affiliation":[{"name":"Department of Mathematics, B.M.S. College of Engineering, Bengaluru 560 019, India"}]},{"given":"M.","family":"Kumara","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Bangalore University, Jnana Bharathi Campus, Bengaluru 560 056, India"}]}],"member":"219","published-online":{"date-parts":[[2022,9,23]]},"reference":[{"key":"S1793830922501440BIB001","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.dam.2017.06.014","volume":"232","author":"Ahangar H. A.","year":"2017","journal-title":"Discrete Appl. Math."},{"issue":"04","key":"S1793830922501440BIB002","doi-asserted-by":"crossref","first-page":"2050047","DOI":"10.1142\/S1793830920500470","volume":"12","author":"Anu V.","year":"2020","journal-title":"Discrete Math. Algorithms Appl."},{"key":"S1793830922501440BIB003","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.dam.2016.03.017","volume":"211","author":"Beeler R. A.","year":"2016","journal-title":"Discrete Appl. Math."},{"key":"S1793830922501440BIB004","first-page":"24","volume":"2","author":"Chaluvaraju B.","year":"2012","journal-title":"Int. J. Math. Comb."},{"volume-title":"Inverse Domination in Graphs","year":"2013","author":"Chelvam T. T.","key":"S1793830922501440BIB005"},{"volume-title":"Domination in Graphs: Advanced Topics","year":"1998","author":"Haynes T. W.","key":"S1793830922501440BIB006"},{"volume-title":"Fundamentals of Domination in Graphs","year":"1998","author":"Haynes T. W.","key":"S1793830922501440BIB007"},{"issue":"12","key":"S1793830922501440BIB008","first-page":"473","volume":"14","author":"Kulli V. R.","year":"1991","journal-title":"Nat. Acad. Sci. Lett."},{"issue":"03","key":"S1793830922501440BIB009","doi-asserted-by":"crossref","first-page":"1350011","DOI":"10.1142\/S1793830913500110","volume":"5","author":"Kumar M. K.","year":"2013","journal-title":"Discrete Math. Algorithms Appl."},{"key":"S1793830922501440BIB011","first-page":"429","volume-title":"Proc. 2nd Int. Conf. Combinatorics, Cryptography and Computation I4C2017","author":"Mojdeh D. A.","year":"2017"},{"key":"S1793830922501440BIB012","first-page":"256","volume":"77","author":"Nazari-Moghaddam S.","year":"2020","journal-title":"Australas. J. Combin."},{"key":"S1793830922501440BIB013","doi-asserted-by":"crossref","first-page":"2250046","DOI":"10.1142\/S179383092250046X","author":"Rad N. J.","year":"2022","journal-title":"Discrete Math. Algorithms Appl."},{"key":"S1793830922501440BIB014","first-page":"41","volume":"39","author":"Rad N. J.","year":"2018","journal-title":"Discuss. Math. Graph Theory"},{"issue":"1","key":"S1793830922501440BIB015","first-page":"45","volume":"79","author":"Soner N. D.","year":"2009","journal-title":"Proc. Nat. Acad. Sci. India Sect. A"},{"issue":"1","key":"S1793830922501440BIB016","first-page":"71","volume":"3","author":"Volkmann L.","year":"2018","journal-title":"Commun. Comb. Optim."},{"key":"S1793830922501440BIB017","first-page":"6481092","volume":"2020","author":"Yang H.","year":"2020","journal-title":"Discrete Dyn. Nat. Soc."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830922501440","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,8]],"date-time":"2023-06-08T08:38:46Z","timestamp":1686213526000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830922501440"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,23]]},"references-count":16,"journal-issue":{"issue":"06","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["10.1142\/S1793830922501440"],"URL":"https:\/\/doi.org\/10.1142\/s1793830922501440","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2022,9,23]]},"article-number":"2250144"}}