id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-5887	Jeyanthi, P.; Nawal M. , NourEldeen; J., Jenisha; K. , Jeya Daisy; M. E. , Abdel-Aal	Edge $k$-Product Cordial Labeling of Graphs	2025	21	.pdf	application/pdf	10413	634	92	Motivated by the concept of ‘edge product cordial labeling’, and the several results established on this concept, we take a step further and introduce a new labeling namely ‘Edge k-product cordial labeling’ as follows: For a graph G = (V (G), E(G)) having no isolated vertex, an edge labeling f : E(G) → {0, 1, ..., A graph that admits an edge k-product cordial labeling is called edge k-product cordial graph.	cache/ejpam-5887.pdf	txt/ejpam-5887.txt