id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-4656	Hassan, Javier; Canoy, Jr., Sergio; Saromines, Chrisley Jade	Convex Hop Domination in Graphs	2023	17	.pdf	application/pdf	8110	696	86	Any clique pointwise non-dominating set in G with cardinality cpnd(G) is called a cpnd-set in G. The shadow graph S(G) of graph G is constructed by taking two copies of G, say G1 and G2, and then joining each vertex u ∈ V (G1) to the neighbors of its corresponding vertex u′ ∈ V (G2). = { nm if G /∈ C γclh(G)cpnd(H) if G ∈ C. The next result is taken from [10].	cache/ejpam-4656.pdf	txt/ejpam-4656.txt