{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T19:27:48Z","timestamp":1774466868968,"version":"3.50.1"},"reference-count":6,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","funder":[{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","award":["MTR\/2018\/000234"],"award-info":[{"award-number":["MTR\/2018\/000234"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2021,8]]},"abstract":"<jats:p> An edge-vertex Roman dominating function (or just ev-RDF) of a graph [Formula: see text] is a function [Formula: see text] such that for each vertex [Formula: see text] either [Formula: see text] where [Formula: see text] is incident with [Formula: see text] or there exists an edge [Formula: see text] adjacent to [Formula: see text] such that [Formula: see text]. The weight of a ev-RDF is the sum of its function values over all edges. The edge-vertex Roman domination number of a graph [Formula: see text], denoted by [Formula: see text], is the minimum weight of an ev-RDF [Formula: see text]. We provide a characterization of all trees with [Formula: see text], where [Formula: see text] is the domination number of [Formula: see text] <\/jats:p>","DOI":"10.1142\/s1793830921500452","type":"journal-article","created":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T03:23:22Z","timestamp":1607138602000},"page":"2150045","source":"Crossref","is-referenced-by-count":4,"title":["On trees with domination number equal to edge-vertex roman domination number"],"prefix":"10.1142","volume":"13","author":[{"given":"H.","family":"Naresh Kumar","sequence":"first","affiliation":[{"name":"Department of Mathematics, SASTRA Deemed University, Thanjavur, Tamilnadu 613401, India"}]},{"given":"Y. B.","family":"Venkatakrishnan","sequence":"additional","affiliation":[{"name":"Department of Mathematics, SASTRA Deemed University, Thanjavur, Tamilnadu 613401, India"}]}],"member":"219","published-online":{"date-parts":[[2020,12,5]]},"reference":[{"key":"S1793830921500452BIB001","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830914500384"},{"key":"S1793830921500452BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2003.06.004"},{"key":"S1793830921500452BIB003","volume-title":"Fundamentals of Domination in Graphs","author":"Haynes T. W.","year":"1998"},{"key":"S1793830921500452BIB004","volume-title":"Domination in Graphs: Advanced Topics","author":"Haynes T. W.","year":"1998"},{"key":"S1793830921500452BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/s12044-016-0267-6"},{"key":"S1793830921500452BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2018.01.012"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830921500452","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T09:06:16Z","timestamp":1626080776000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830921500452"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,5]]},"references-count":6,"journal-issue":{"issue":"04","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["10.1142\/S1793830921500452"],"URL":"https:\/\/doi.org\/10.1142\/s1793830921500452","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,12,5]]}}}