{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T21:06:31Z","timestamp":1761599191854,"version":"3.37.3"},"reference-count":10,"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":[[2020,2]]},"abstract":"<jats:p> A function [Formula: see text] is a double Roman dominating function on a graph [Formula: see text] if for every vertex [Formula: see text] with [Formula: see text] either there is a vertex [Formula: see text] with [Formula: see text] or there are distinct vertices [Formula: see text] with [Formula: see text] and for every vertex [Formula: see text] with [Formula: see text] there is a vertex [Formula: see text] with [Formula: see text]. The weight of a double Roman dominating function [Formula: see text] on [Formula: see text] is the value [Formula: see text]. The minimum weight of a double Roman dominating function on [Formula: see text] is called the double Roman domination number of [Formula: see text]. In this paper, we give an algorithm to compute the double Roman domination number of a given proper interval graph [Formula: see text] in [Formula: see text] time. <\/jats:p>","DOI":"10.1142\/s1793830920500111","type":"journal-article","created":{"date-parts":[[2019,11,13]],"date-time":"2019-11-13T02:45:06Z","timestamp":1573613106000},"page":"2050011","source":"Crossref","is-referenced-by-count":6,"title":["A linear algorithm for double Roman domination of proper interval graphs"],"prefix":"10.1142","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2506-0590","authenticated-orcid":false,"given":"Abolfazl","family":"Poureidi","sequence":"first","affiliation":[{"name":"Faculty of Mathematical Sciences, Shahrood University of Technology, Shahrood, Iran"}]}],"member":"219","published-online":{"date-parts":[[2019,12,30]]},"reference":[{"key":"S1793830920500111BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2017.06.014"},{"key":"S1793830920500111BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.03.040"},{"key":"S1793830920500111BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2016.03.017"},{"key":"S1793830920500111BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.06.007"},{"volume-title":"Fundamentals of Domination in Graphs","year":"1998","author":"Haynes T. W.","key":"S1793830920500111BIB005"},{"key":"S1793830920500111BIB006","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830915500202"},{"key":"S1793830920500111BIB007","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.2000.12005243"},{"key":"S1793830920500111BIB008","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican1299-136"},{"key":"S1793830920500111BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2018.06.033"},{"key":"S1793830920500111BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2018.01.004"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830920500111","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T21:34:11Z","timestamp":1581975251000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830920500111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,30]]},"references-count":10,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["10.1142\/S1793830920500111"],"URL":"https:\/\/doi.org\/10.1142\/s1793830920500111","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2019,12,30]]}}}