{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T06:27:56Z","timestamp":1649140076473},"reference-count":13,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2020,8]]},"abstract":"<jats:p> Let [Formula: see text] be a graph and [Formula: see text] be a function. A vertex [Formula: see text] with weight [Formula: see text] is said to be undefended with respect to [Formula: see text], if it is not adjacent to any vertex with positive weight. The function [Formula: see text] is a weak Roman dominating function (WRDF) if each vertex [Formula: see text] with [Formula: see text] is adjacent to a vertex [Formula: see text] with [Formula: see text] such that the function [Formula: see text] defined by [Formula: see text], [Formula: see text] and [Formula: see text] if [Formula: see text], has no undefended vertex. The weight of [Formula: see text] is [Formula: see text]. The weak Roman domination number, denoted by [Formula: see text], is the minimum weight of a WRDF on [Formula: see text]. In this paper, we present two linear time algorithms one that obtains the weak Roman domination number of an arbitrary tree and the labeling of its vertices, to produce the weak Roman domination number, and the other, that determines whether the given tree is in [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830920500494","type":"journal-article","created":{"date-parts":[[2020,6,15]],"date-time":"2020-06-15T13:31:41Z","timestamp":1592227901000},"page":"2050049","source":"Crossref","is-referenced-by-count":1,"title":["An algorithm to recognize weak roman domination stable trees under vertex deletion"],"prefix":"10.1142","volume":"12","author":[{"given":"B.","family":"Mahavir","sequence":"first","affiliation":[{"name":"Department of Mathematics, A. M. Jain College, Chennai 600 114, Tamil Nadu, India"}]},{"given":"P.","family":"Roushini Leely Pushpam","sequence":"additional","affiliation":[{"name":"Department of Mathematics, D. B. Jain College, Chennai 600 097, Tamil Nadu, India"}]},{"given":"M.","family":"Kamalam","sequence":"additional","affiliation":[{"name":"Department of Mathematics, S. S. Shasun Jain College, Chennai 600 017, Tamil Nadu, India"}]}],"member":"219","published-online":{"date-parts":[[2020,6,15]]},"reference":[{"key":"S1793830920500494BIB001","author":"Chapelle M.","year":"2017","journal-title":"Discrete Applied Mathematics"},{"key":"S1793830920500494BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2003.06.004"},{"key":"S1793830920500494BIB003","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2013","edition":"3"},{"key":"S1793830920500494BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(02)00811-7"},{"key":"S1793830920500494BIB005","volume-title":"Fundamental of Computer Algorithms","author":"Horowitz E.","year":"2003"},{"key":"S1793830920500494BIB006","first-page":"86","volume-title":"Proc. 27th Workshop on Combinatorial Mathematics and Computation Theory","author":"Liu Chich-S.","year":"2010"},{"key":"S1793830920500494BIB007","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican1299-136"},{"issue":"2","key":"S1793830920500494BIB008","first-page":"97","volume":"25","author":"Roushini Leely Pushpam P.","year":"2018","journal-title":"Asian J. Math. Comput. Res."},{"key":"S1793830920500494BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.akcej.2017.12.003"},{"key":"S1793830920500494BIB010","first-page":"49","volume":"67","author":"Roushini Leely Pushpam P.","year":"2008","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"S1793830920500494BIB011","first-page":"175","volume":"67","author":"Roushini Leely Pushpam P.","year":"2009","journal-title":"J. Combin Math. Combin Comput."},{"key":"S1793830920500494BIB012","first-page":"115","volume":"31","author":"Roushini Leely Pushpam P.","year":"2011","journal-title":"Graph Theory"},{"issue":"1","key":"S1793830920500494BIB013","first-page":"1","volume":"4","author":"Roushini Leely Pushpam P.","year":"2015","journal-title":"Trans. Combin."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830920500494","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,13]],"date-time":"2020-08-13T09:58:38Z","timestamp":1597312718000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830920500494"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,15]]},"references-count":13,"journal-issue":{"issue":"04","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["10.1142\/S1793830920500494"],"URL":"https:\/\/doi.org\/10.1142\/s1793830920500494","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,15]]}}}