id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-5332	Samson, Harold; Aniversario, Imelda S. ; Luga, Mary Joy F. 	Convex Accessibility Number of the Complements and Some Binary Operations of Graphs	2024	9	.pdf	application/pdf	3692	206	77	The distance between ver- tices (u, v) and (u′, v′) in the Strong product G ⊠ H is equal to dG⊠H((u, v), (u′, v′)) A set C ∈ V (G ⊠ H) is a convex set in G ⊠ H if and only if C = CG ⊠ CH , where CG and CH are convex sets in G and H respectively. Proof.	cache/ejpam-5332.pdf	txt/ejpam-5332.txt