id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-4500	Pagcu, Ethel Mae; Malacas, Gina; Canoy, Jr., Sergio	Locating Hop Sets in a Graph	2022	11	.pdf	application/pdf	5999	420	86	∩ S. A set S ⊆ V (G) is strictly locating if it is locating and NG(u) ∩ S ̸= S for all u ∈ V (G) \ S. Locating Hop Sets in the Corona of Graphs The corona of two graphs G and H, denoted by G ◦ H, is the graph obtained by taking one copy of G of order n and n copies of H, and then joining the vertex vi of G to every vertex of the ith copy of H. For every v ∈ V (G), denote by Hv the copy of H whose vertices are joined or attached to the vertex v. Denote by v +Hv the subgraph of the corona G ◦H corresponding to the join ⟨{v}⟩+Hv.	cache/ejpam-4500.pdf	txt/ejpam-4500.txt