In this paper, the authors have determined certain upper and lower bounds for Roman domination numbers on cardinal products for any two graphs and some exact values for the cardinal product of paths and cycles. Roman domination was named after the historical fact that Roman legions were distributed across regions during the reign of the Roman Emperor Constantine in the 4th century A.D. Some areas had 1 or 2 legions, some had no legions, but every area had at least 1 neighboring area with 2 legions. Roman domination is used even today, not only in military situations, but also in protecting some locations against fire or crime
A Roman dominating function of a graph ▫$G = (V,E)$▫ is a function ▫$f colon V to {0,1,2}$▫ such tha...
A Roman dominating function of a graph G is a labeling f: V(G) →{0,1,2} such that every vertex with ...
AbstractA Roman dominating function of a graph G is a labeling f:V(G)⟶{0,1,2} such that every vertex...
In this paper, the authors have determined certain upper and lower bounds for Roman domination numbe...
Abstract. In this paper, the authors have determined certain upper and lower bounds for Roman domina...
In this paper, the authors have determined certain upper and lower bounds for Roman domination numbe...
AbstractA Roman dominating function of a graph G=(V,E) is a function f:V→{0,1,2} such that every ver...
Let G be a graph with vertex set V(G). A function f : V(G) -> {0, 1, 2) is a Roman dominating functi...
AbstractA Roman dominating function of a graph G is a function f:V(G)→{0,1,2} such that whenever f(v...
AbstractA Roman dominating function of a graph G is a function f:V(G)→{0,1,2} such that whenever f(v...
AbstractA Roman domination function on a graph G=(V(G),E(G)) is a function f:V(G)→{0,1,2} satisfying...
Abstract. Roman dominating function of a graph G is a labeling function f: V (G) → {0, 1, 2} such th...
AbstractLet G=(V,E) be a simple graph. A subset S⊆V is a dominating set of G, if for any vertex u∈V-...
A Roman dominating function of a graph G is a function f : V (G) → {0, 1, 2} such that whenever f(v)...
A Roman dominating function (RDF) on a graph tt = (V, E) is a function f : V (tt) 0, 1, 2 satisfyi...
A Roman dominating function of a graph ▫$G = (V,E)$▫ is a function ▫$f colon V to {0,1,2}$▫ such tha...
A Roman dominating function of a graph G is a labeling f: V(G) →{0,1,2} such that every vertex with ...
AbstractA Roman dominating function of a graph G is a labeling f:V(G)⟶{0,1,2} such that every vertex...
In this paper, the authors have determined certain upper and lower bounds for Roman domination numbe...
Abstract. In this paper, the authors have determined certain upper and lower bounds for Roman domina...
In this paper, the authors have determined certain upper and lower bounds for Roman domination numbe...
AbstractA Roman dominating function of a graph G=(V,E) is a function f:V→{0,1,2} such that every ver...
Let G be a graph with vertex set V(G). A function f : V(G) -> {0, 1, 2) is a Roman dominating functi...
AbstractA Roman dominating function of a graph G is a function f:V(G)→{0,1,2} such that whenever f(v...
AbstractA Roman dominating function of a graph G is a function f:V(G)→{0,1,2} such that whenever f(v...
AbstractA Roman domination function on a graph G=(V(G),E(G)) is a function f:V(G)→{0,1,2} satisfying...
Abstract. Roman dominating function of a graph G is a labeling function f: V (G) → {0, 1, 2} such th...
AbstractLet G=(V,E) be a simple graph. A subset S⊆V is a dominating set of G, if for any vertex u∈V-...
A Roman dominating function of a graph G is a function f : V (G) → {0, 1, 2} such that whenever f(v)...
A Roman dominating function (RDF) on a graph tt = (V, E) is a function f : V (tt) 0, 1, 2 satisfyi...
A Roman dominating function of a graph ▫$G = (V,E)$▫ is a function ▫$f colon V to {0,1,2}$▫ such tha...
A Roman dominating function of a graph G is a labeling f: V(G) →{0,1,2} such that every vertex with ...
AbstractA Roman dominating function of a graph G is a labeling f:V(G)⟶{0,1,2} such that every vertex...