id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-6849	Tayab, Jerry; Jamil, Ferdinand; Aniversario, Imelda	Vertex-Edge Dominating Sets of Some Graphs Under Binary Operations	2025	19	.pdf	application/pdf	9983	731	89	Let S ⊆ V (GG) be a γve-set of GG with v ∈ S. Let S∗ = {w ∈ V (G − v) : w ∈ S}, and put T = S∗ ∪ (S ∩ V (G − v)). A subset S ⊆ V (G) is a vertex-edge dominating set of G if for each xy ∈ E(G), there exists u ∈ S such that u vertex-edge dominates xy.	cache/ejpam-6849.pdf	txt/ejpam-6849.txt