Signed roman star edge dominance of graphs
In this paper, a study has been started on a new variation of the problem on signed roman
domination called signed roman star edge dominance problem. A mapping g: E→{− 1, 1, 2} …
domination called signed roman star edge dominance problem. A mapping g: E→{− 1, 1, 2} …
Signed Edge Domination Number of Interval Graphs
Abstract Let G=(V, E) be an undirected graph with vertex set V and edge set E. The open
neighborhood N (e) of an edge e∈ E is the set of all edges adjacent to e. The closed …
neighborhood N (e) of an edge e∈ E is the set of all edges adjacent to e. The closed …
[PDF][PDF] Roman Domination on Acyclic Permutation Graphs
A function f: V→[0, 1, 2] is said to be Roman dominating function on a graph G=(V, E) if the
function f satisfies the condition that every vertex u for which f (u)= 0 has at least one …
function f satisfies the condition that every vertex u for which f (u)= 0 has at least one …
[PDF][PDF] Edge Roman Star Domination Number on Graphs
Edge Roman Star Domination Number on Graphs Page 1 Annals of Pure and Applied
Mathematics Vol. 14, No. 1, 2017, 143-152 ISSN: 2279-087X (P), 2279-0888(online) …
Mathematics Vol. 14, No. 1, 2017, 143-152 ISSN: 2279-087X (P), 2279-0888(online) …