id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-3657	Caadan, Julius Guhiting; Paluga, Rolando N.; Aniversario, Imelda S.	Upper Distance k-Cost Effective Number in the Join of Graphs	2020	9	.pdf	application/pdf	3552	248	84	The concept of cost effective set in graph was introduced by Haynes, et.al. A set S ⊆ V (G) is a distance k- cost effective set of G if for every v ∈ S, |Nk G(v) ∩ Sc| − |Nk G(v) ∩ S| ≥ 0.	cache/ejpam-3657.pdf	txt/ejpam-3657.txt