id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-4810	Saromines , Chrisley Jade; Canoy Jr. , Sergio	Another Look at Geodetic Hop Domination in a Graph	2023	12	.pdf	application/pdf	5089	433	85	Since S is a hop dominating set, by Theorem 3, SG and SH are pointwise non-dominating sets of G and H, respectively. The smallest cardinality of a pointwise non-dominating set of G, denoted by pnd(G), is called the pointwise non-domination number of G. A pointwise non-dominating set S ⊆ V (G) of a graph G is called a 2-path closure absorbing pointwise non-dominating set if it is a 2-path closure absorbing set.	cache/ejpam-4810.pdf	txt/ejpam-4810.txt