id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-5648	Aradais, Alkajim; Cariaga, Jerry Boy; Canoy, Jr., Sergio 	Connected Roman Hop Dominating Functions in Graphs	2025	13	.pdf	application/pdf	6441	572	89	= 3 if and only if G = K1 and H = K2 (or H = K1 and G = K2) or G = K1 and H is a graph with at least one isolated vertex (or H = K1 and G is a graph with at least one isolated vertex). Math, 18 (1) (2025), 5648 10 of 13 For the converse, suppose G = Kn and let S be a gammach-set in G. Since S is a hop dominating set, V (Kn)	cache/ejpam-5648.pdf	txt/ejpam-5648.txt