We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Mixed Roman Domination in Graphs.
- Authors
Ahangar, H.; Haynes, Teresa; Valenzuela-Tripodoro, J.
- Abstract
Let $$G = (V, E)$$ be a simple graph with vertex set V and edge set E. A mixed Roman dominating function (MRDF) of G is a function $$f: V\cup E\rightarrow \{0,1,2\}$$ satisfying the condition every element $$x\in V\cup E$$ for which $$f(x)= 0$$ is adjacent or incident to at least one element $$y\in V\cup E$$ for which $$f(y) = 2$$ . The weight of a MRDF f is $$\omega (f)=\sum _{x\in V\cup E}f(x)$$ . The 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.
- Subjects
DOMINATING set; GRAPH theory; PATHS &; cycles in graph theory; ROMAN numerals; MATHEMATICAL bounds; MATHEMATICAL functions
- Publication
Bulletin of the Malaysian Mathematical Sciences Society, 2017, Vol 40, Issue 4, p1443
- ISSN
0126-6705
- Publication type
Article
- DOI
10.1007/s40840-015-0141-1