Restrained Disjunctive Domination in Graphs under Some Binary Operations
Keywords:Disjunctive dominating set, restrained disjunctive dominating set, restrained disjunctive domination number, join, corona and lexicographic product
A set S âŠ† V (G) is a disjunctive dominating set of a graph G if for every v âˆˆ V (G)\S, v is a neighbor of a vertex in S or S has at least two vertices each at distance 2 from v. We say that a disjunctive dominating set S of G is a restrained disjunctive dominating set if for each v âˆˆ V (G)\S there exists u âˆˆ V (G) \ S such that uv âˆˆ E(G) or there exist distinct vertices u, w âˆˆ V (G) \ S such that dG(u, v) = 2 = dG(w, v). The minimum cardinality Î³dr(G) of a restrained disjunctive dominating set of G is the restrained disjunctive domination number of G. In this paper, we characterize the restrained disjunctive dominating sets in some binary operations such as the join, corona and lexicographic product of graphs and, as a result, obtain the values of their corresponding restrained disjunctive domination numbers.
How to Cite
Upon acceptance of an article by the journal, the author(s) accept(s) the transfer of copyright of the article to European Journal of Pure and Applied Mathematics.
European Journal of Pure and Applied Mathematics will be Copyright Holder.