Differentiating Odd Dominating Sets in Graphs

Let G= (V (G), E (G) ) be a simple and undirected graph. A dominating set S V (G) is called a differentiating odd dominating set if for every vertex v V (G), |Nv S| 1 (mod\ 2) and NGu S NGv S for every two distinct vertices u and v of V (G). The minimum cardinality of a differentiating odd dominating set of G, denoted by Dᵒ (G), is called the differentiating odd domination number. In this paper, we discuss differentiating odd dominating set in some graphs and give relationships between the differentiating odd domination, odd domination, and differentiating-domination numbers. Moreover, we characterize the differentiating odd dominating sets in graphs resulting from join, corona, and lexicographic product of graphs and determine the differentiating odd domination numbers of these graphs.