4-Total edge mean cordial labeling of some classes of convex polytopes
Loading...
Date
2019-11-07
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
UMT Lahore
Abstract
In this thesis, we study the type of graph labeling known as k-total edge mean cordial (k-TEMC) labeling of graphs introduced by F. Aslam at al. (see [2]), which is a generalization of edge mean cordial labeling (see [17]). We discussed some classes of convex polytopes graphs and their different combinations in the context of k-TEPC labeling for k = 4