Hafiz M Tariq Mahmood2025-11-192025-11-192018-07-27https://escholar.umt.edu.pk/handle/123456789/10705In this thesis, we introduce new labeling and called it as k-total edge mean cordial (k-TEMC) labeling of graphs, which is a generalization of edge mean cordial labeling (see [9]). We discussed path graph, ladder graph, comb graph, double comb graph, cycle graph, wheel graph, sun-let graph, helm graph, gear graph and prism graph in the context of k-TEMC labeling for k = 4.enThesis