id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-4671	Mohamad, Jerson; Rara, Helen	1-Movable Resolving Hop Domination in Graphs	2023	12	.pdf	application/pdf	5756	316	80	Then W ⊆ V (G ◦ H) is a resolving hop dominating set of G ◦ H if and only if W ∩ V (Hv) ̸= ∅ for every v ∈ V (G) and W = A ∪B ∪D where A ⊆ V (G), B = ∪ {Bv : v ∈ V (G) ∩NG(A) and Bv is a locating set of Hv} and D = ∪ {Du : u ∈ V (G) \NG(A) and Du is a strictly locating set of Hu} . Then W ⊆ V (G ◦ H) is a 1-movable resolving hop dominating set of G ◦ H if and only if W ∩ V (Hv) ̸= ∅ for every v ∈ V (G) and W = A ∪  ⋃ v∈NG(A)	cache/ejpam-4671.pdf	txt/ejpam-4671.txt