id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-6635	Alfeche, Farene Loida; Canoy Jr., Sergio	Secure Pointwise Non-Domination and Secure Hop Domination in Graphs	2025	11	.pdf	application/pdf	5257	424	84	Then S ⊆ V (G+H) is a secure hop dominating set if and only if S = SG ∪ SH and SG and SH are secure pointwise non-dominating sets in G and H, respectively. Suppose S is a secure hop dominating set in G+H. Since S is a hop dominating set, S = SG ∪ SH where SG and SH are pointwise non-dominating sets in G and H, respectively, by Theorem 5.	cache/ejpam-6635.pdf	txt/ejpam-6635.txt