Majority Roman domination in graphs
Keyword(s):
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.
2017 ◽
Vol 48
(2)
◽
pp. 135-147
◽
2020 ◽
Vol 12
(02)
◽
pp. 2050020
2021 ◽
pp. 556-562
2013 ◽
Vol 05
(03)
◽
pp. 1350011
2020 ◽
Vol 13
(3)
◽
pp. 529-548