{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T13:38:05Z","timestamp":1756993085444,"version":"3.41.2"},"reference-count":6,"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> A Majority Roman Dominating Function (MRDF) on a graph [Formula: see text] is a function [Formula: see text] satisfying the conditions that (i) the sum of its function values over at least half the closed neighborhood is at least one and (ii) every vertex [Formula: see text] for which [Formula: see text] is adjacent to at least one vertex [Formula: see text] for which [Formula: see text]. The weight of a MRDF is the sum of its function values over all vertices. The Majority Roman Domination Number of a graph [Formula: see text], denoted by [Formula: see text], is defined as [Formula: see text]. In this paper, we initiate the study of Majority Roman Domination in Graphs. <\/jats:p>","DOI":"10.1142\/s1793830921500622","type":"journal-article","created":{"date-parts":[[2020,11,25]],"date-time":"2020-11-25T11:24:51Z","timestamp":1606303491000},"source":"Crossref","is-referenced-by-count":4,"title":["Majority Roman domination in graphs"],"prefix":"10.1142","volume":"13","author":[{"given":"S.","family":"Anandha Prabhavathy","sequence":"first","affiliation":[{"name":"Department of Mathematics, Velammal College of Engineering and Technology, Madurai, India"}]}],"member":"219","published-online":{"date-parts":[[2020,12,16]]},"reference":[{"key":"S1793830921500622BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-012-9500-0"},{"key":"S1793830921500622BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(94)00194-N"},{"key":"S1793830921500622BIB003","volume-title":"Graphs and Digraphs","author":"Chartrand G.","year":"2005","edition":"4"},{"volume-title":"Domination in Graphs: Advanced Topics","year":"1998","author":"Haynes T. W.","key":"S1793830921500622BIB004"},{"key":"S1793830921500622BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(00)00370-8"},{"key":"S1793830921500622BIB006","doi-asserted-by":"publisher","DOI":"10.1007\/s10587-005-0025-x"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830921500622","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,14]],"date-time":"2021-10-14T03:59:19Z","timestamp":1634183959000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830921500622"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,16]]},"references-count":6,"journal-issue":{"issue":"05","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["10.1142\/S1793830921500622"],"URL":"https:\/\/doi.org\/10.1142\/s1793830921500622","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":"2150062"}}