3-total edge mean cordial labeling of some standard graphs
OMS-Vol. 3 (2019), Issue 1, pp. 129–138 Open Access Full-Text PDF
Fakhir Aslam, Zohaib Zahid, Sohail Zafar
Abstract: In this paper, we introduce new labeling and named it as k-total edge mean cordial (k-TEMC) labeling. We study certain classes of graphs namely path, double comb, ladder and fan in the context of 3-TEMC labeling.