id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-4055	Mohamad, Jerson Saguin; Rara, Helen M.	On Resolving Hop Domination in Graphs	2021	9	.pdf	application/pdf	4430	293	84	Then W ⊆ V (G◦H) is a resolving set of G ◦H if and only if W ∩ V (Hv) 6= Then W ⊆ V (G ◦ H) is a resolving hop dominating set of G ◦H if and only if W ∩ V (Hv) 6= ∅ 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} .	cache/ejpam-4055.pdf	txt/ejpam-4055.txt