id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-5213	Carbero, Mary Ann; Malacas, Gina; Canoy, Sergio	Differentiating Odd Dominating Sets in Graphs	2024	17	.pdf	application/pdf	8125	605	75	Then S ⊆ V (G + H) is a differentiating odd dominating set in G + H if and only if S = SG ∪ SH , where SG and SH are differentiating sets in G and H, respectively, either SG or SH is strictly differentiating, and one of the following statements holds: (i) |SG| and |SH | are even, and SG and SH are both odd dominating sets in G and H, respectively. (ii) |SG| and |SH | are odd, and SG and SH are both even dominating sets in G and H, respectively. (iii) |SG| is odd, |SH | is even, SG is odd dominating in G, SH is even dominating set in H. (iv) |SG| is even, |SH | is odd, SG is even dominating in G, and SH is odd dominating sets in H. Proof. In this paper, we discuss differentiating odd dominating sets and give bounds or exact values of the differentiating odd domination numbers of some graphs.	cache/ejpam-5213.pdf	txt/ejpam-5213.txt