3-total edge mean cordial labeling of some standard graphs

W e begin with finite, undirected, simple and connected graph G = (VG , EG). The set VG is called vertex set and the set EG is called edge set of graph G. Order of a graph is the number of vertices in G and size of a graph is the number of edges in G. We follow the standard notations and terminology of graph theory as in [1]. Graph labeling were first introduced in the late 1960′s. A graph labeling is an assignment of integers to the vertices or edges or both subject to certain condition(s). If the domain of mapping is the set of vertices (or edges) then the labeling is called a vertex labeling (or an edge labeling). We have the following notations, in order to know cordial labeling α and its sorts .