id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-3506	Bent-Usman, Wardah Masanggila; Isla, Rowena; Canoy, Sergio	Neighborhood Connected k-Fair Domination Under Some Binary Operations	2019	13	.pdf	application/pdf	5505	433	90	Conversely, suppose G = H + K1 for some connected graph H. Let 〈S〉 = K1 = 〈{v}〉. 6. Neighborhood Connected k-Fair Domination in the Cartesian Product of Graphs The Cartesian product of two graphs G and H, denoted by G�H, is the graph with vertex-set V (G�H)	cache/ejpam-3506.pdf	txt/ejpam-3506.txt