id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-4883	Hassan, Javier; Salim, Jeffrey Imer	$J$-Domination in Graphs	2023	14	.pdf	application/pdf	6278	494	88	On the other hand, suppose that D = DG ∪ DH , where either DH = ∅ and DG = D is γJ - set in G or DG = ∅ and DH = D is γJ -set in H. Then by Theorem 10, D is a J-dominating set in G + H. The closed neighborhood of X in G is the set NG[X] = NG(X)∪X. A subset D of V (G) is called a dominating of G if for every x ∈ V (G) \ D, there exists y ∈ D such that xy ∈ E(G).	cache/ejpam-4883.pdf	txt/ejpam-4883.txt