No abstract

No abstract

Let G = (V, E) be a simple graph with vertex set V and edge set E. A mixed Roman dominating functionThe mixed Roman domination number of G is the minimum weight of a mixed Roman dominating function of G. In this paper, we initiate the study of the mixed Roman domination number and we present bounds for this parameter. We characterize the graphs attaining an upper bound and the graphs having small mixed Roman domination numbers.

No abstract

No abstract