Restrained roman domination in graphs
A Roman dominating function (RDF) on a graph G = (V,E) is defined to be a function satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. A set S V is a Restrained dominating set if every vertex not in S is adjacent to a vertex in S...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2015-03-01
|
| Series: | Transactions on Combinatorics |
| Subjects: | |
| Online Access: | http://www.combinatorics.ir/pdf_4395_4464d5648abc97e1c5cf12df1d49d67c.html |