id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-4484	Abragan, Armalene; Rara, Helen	Restrained Strong Resolving Hop Domination in Graphs	2022	10	.pdf	application/pdf	4900	276	78	[8] The corona G ◦H of graphs G and H, is the graph obtained by taking one copy of G of order n and n copies of H, and then joining the ith vertex 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 attached one by one to the vertex v. Subsequently, denote by v + Hv the subgraph of the corona G ◦H corresponding to the join ⟨{v}⟩+Hv, v ∈ V (G). ̸= ∅. Proof : Suppose S is a restrained resolving hop dominating set of G ◦ H.	cache/ejpam-4484.pdf	txt/ejpam-4484.txt