id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-6075	Alfeche, Farene Loida; Malacas, Gina; Canoy Jr, Sergio	Secure Hop Dominating Sets in Graphs	2025	14	.pdf	application/pdf	7673	673	87	(iii) S = SG1 ∪ SG2 such that SG1 ∪ S′ G2 and S′ G1 ∪ SG2 are secure hop dominating sets in G1 and G2, respectively. The minimum cardinality among all secure hop dominating sets of G, denoted by γsh(G), is called the secure hop domination number of G.	cache/ejpam-6075.pdf	txt/ejpam-6075.txt