Affiliation:
1. Department of Mathematics, Velammal College of Engineering and Technology, Madurai, India
Abstract
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.
Publisher
World Scientific Pub Co Pte Ltd
Subject
Discrete Mathematics and Combinatorics
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On perfect Italian domination in graphs;Discrete Mathematics, Algorithms and Applications;2023-10-31
2. Majority double Roman domination in graphs;Discrete Mathematics, Algorithms and Applications;2023-10-06
3. Secure equitability in graphs;Discrete Mathematics, Algorithms and Applications;2022-04-27