Majority double Roman domination in graphs

A majority double Roman dominating function (MDRDF) on a graph [Formula: see text] is a function [Formula: see text] such that (i) every vertex [Formula: see text] with [Formula: see text] is adjacent to at least two vertices assigned with 2 or to at least one vertex [Formula: see text] with [Formula: see text], (ii) every vertex [Formula: see text] with [Formula: see text] is adjacent to at least one vertex [Formula: see text] with [Formula: see text] and (iii) [Formula: see text], for at least half of the vertices in [Formula: see text]. The weight of an MDRDF is the sum of its function values over all vertices. The majority double Roman domination number of a graph [Formula: see text], denoted by [Formula: see text], is defined as [Formula: see text]. In this paper, we introduce and study the majority double Roman domination number on some classes of graphs.