{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:21:59Z","timestamp":1753885319901,"version":"3.41.2"},"reference-count":10,"publisher":"World Scientific Pub Co Pte Ltd","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2021,10]]},"abstract":"<jats:p> Let [Formula: see text] be a graph, and let [Formula: see text] be an induced path centered at [Formula: see text]. An edge lift defined on [Formula: see text] is the action of removing edges [Formula: see text] and [Formula: see text] while adding the edge [Formula: see text] to the edge set of [Formula: see text]. In this paper, we initiate the study of the effects of edge lifting on the Roman domination number of a graph, where various properties are established. A characterization of all trees for which every edge lift increases the Roman domination number is provided. Moreover, we characterize the edge lift of a graph decreasing the Roman domination number, and we show that there are no graphs with at most one cycle for which every possible edge lift can have this property. <\/jats:p>","DOI":"10.1142\/s1793830921500646","type":"journal-article","created":{"date-parts":[[2020,11,25]],"date-time":"2020-11-25T11:24:51Z","timestamp":1606303491000},"source":"Crossref","is-referenced-by-count":0,"title":["Edge lifting and Roman domination in graphs"],"prefix":"10.1142","volume":"13","author":[{"given":"Hicham","family":"Meraimi","sequence":"first","affiliation":[{"name":"Faculty of Mathematics, Laboratory L\u2019IFORCE, University of Sciences and Technology Houari Boumediene, (USTHB) Algiers, Algeria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mustapha","family":"Chellali","sequence":"additional","affiliation":[{"name":"LAMDA-RO Laboratory, Department of Mathematics, University of Blida, B. P. 270, Blida, Algeria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2020,12,16]]},"reference":[{"key":"S1793830921500646BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-51117-3_11"},{"key":"S1793830921500646BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2003.06.004"},{"key":"S1793830921500646BIB003","first-page":"77","volume":"63","author":"Desormeaux W. J.","year":"2011","journal-title":"Bull. Inst. Combin. Appl."},{"key":"S1793830921500646BIB004","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2989\/16073606.2011.570290","volume":"34","author":"Desormeaux W. J.","year":"2011","journal-title":"Quaest. Math."},{"key":"S1793830921500646BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-011-9416-0"},{"key":"S1793830921500646BIB006","first-page":"55","volume":"101","author":"Gunther G.","year":"1994","journal-title":"Congr. Numer."},{"volume-title":"Lecture, Conference of Graph Theory","year":"1974","author":"Lov\u00e1sz L.","key":"S1793830921500646BIB007"},{"key":"S1793830921500646BIB008","volume-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz L.","year":"1993","edition":"2"},{"key":"S1793830921500646BIB009","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.2000.12005243"},{"key":"S1793830921500646BIB010","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican1299-136"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830921500646","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,14]],"date-time":"2021-10-14T03:59:07Z","timestamp":1634183947000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830921500646"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,16]]},"references-count":10,"journal-issue":{"issue":"05","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["10.1142\/S1793830921500646"],"URL":"https:\/\/doi.org\/10.1142\/s1793830921500646","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2020,12,16]]},"article-number":"2150064"}}