id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-4127	Palco, Jesrael Bataluna; Paluga, Rolando N.; Malacas, Gina A.	On k-Cost Effective Domination Number in the Join of Graphs	2021	13	.pdf	application/pdf	4575	219	80	This implies that, |NG(x) \ S1| − |NG(x) ∩ S1| ≥ k − |V (H)|+ 2|V (H) ∩ S| = k − (|V (H)| − 2|V (H) ∩ S|) Then S is a k-cost effective dominating set in G + H if and only if one of the following holds: (i) S is (k − |V (H)|)-cost effective dominating set in G; (ii) S is (k − |V (G)|)-cost effective dominating set in H; (iii) V (G) ∩ S is (k − k1)-cost effective dominating set in G, where k1 = |V (H)| − 2|V (H) ∩ S| and V (H) ∩ S is (k − k2)-cost effective dominating set in H, where k2 = |V (G)| − 2|V (G) ∩ S|.	cache/ejpam-4127.pdf	txt/ejpam-4127.txt