On disjunctive domination number of corona related graphs

Abstract

A disjunctive dominating set in a graph G is a set S ⊂ V(G) such that every vertex v ∈V(G) \ S is either adjacent to a vertex in S or has at least 2 vertices in S at a distance 2 from it in G. The disjunctive domination number of G, denoted by γ₂d(G), is the minimum cardinality of a disjunctive dominating set in G. In this paper we investigate disjunctive domination number of some corona related graphs.