id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-4381	Caadan, Julius Guhiting; Paluga, Rolando N. ; Aniversario, Imelda S. 	Distance k-Cost Effective Sets in the Corona and Lexicographic Product of Graphs	2023	10	.pdf	application/pdf	4053	236	85	Hence, |Nk G[H](u, v) ∩ (V (G[H])\(A× V (H)))| − |Nk G[H](u, v) ∩ (A× V (H))| = |Nk G(u) ∩ (V (G) \A)||V (H)| − |Nk G(u) ∩A||V (H)| − |V (H)| = ( |Nk G(u) ∩ (V (G) The concept of cost effective set in graph was introduced by Haynes et al. in [7].	cache/ejpam-4381.pdf	txt/ejpam-4381.txt