Main Article Content
In a graph G(V,E) is a mapping such that and the mapping satisfies the condition where donates the total number of edges labeled with . The graph consist total mean cordial labeling it named as a total mean cordial graph. In this paper, we will investigate the total mean cordial labeling in various graphs like brush graph, ladder graph, triangular ladder graph. Further explain the theorem with examples.