id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-4587	Hamja, Jamil; Aniversario, Imelda S. ; Merca, Catherina I.	Weakly Connected Hop Domination in Graphs Resulting from Some Binary Operations	2023	11	.pdf	application/pdf	5434	362	83	Pick u ∈ S ∩ V (G) and v ∈ S ∩ V (H). The corona G ◦H of graphs G and H, is the graph obtained by taking one copy of G and |V (G)| 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), Harary	cache/ejpam-4587.pdf	txt/ejpam-4587.txt