On the Roman Edge Domination Number of a Graph

For an integer n ≥ 2, let I ⊂ {0, 1, 2, · · · , n}. A Smarandachely Roman sdominating function for an integer s, 2 ≤ s ≤ n on a graph G = (V,E) is a function f : V → {0, 1, 2, · · · , n} satisfying the condition that |f(u)− f(v)| ≥ s for each edge uv ∈ E with f(u) or f(v) ∈ I . Similarly, a Smarandachely Roman edge s-dominating function for an integer s, 2… CONTINUE READING