Total mean cordial labeling of some graphs

Abstract

A Total Mean Cordial labeling of a graph G = (V, E) is a function / : V(G) - {0,1,2} such that f(xy) = |f(x)+f+y)/2j wh€re € V{G)> xy ϵ V(G)t and (evf(i)-evf(j)) < 1, ij ϵ {0,1,2} where evf(x) denotes the total number of vertices and edges labeled with x (x = 0,1,2). If there exists a total mean cordial labeling on a graph G, we will call G is Total Mean Cordial. In this paper, we investigate the Total Mean Cordial labeling behaviour of Lotus inside a circle, bistar, flower graph, and some more graphs. © 2018 Utilitas Mathematica Publishing Inc. All rights reserved.