TREE RELATED EXTENDED MEAN CORDIAL GRAPHS

Let G = (V, E) be a graph with p vertices and q edges. A Extended Mean Cordial Labeling of a Graph G with vertex set V is a bijection from V to {0, 1, 2} such that each edge uv is assigned the label ( ⌈????(????) + ????(????))⌉⁄???? where ⌈ x ⌉ is the least integer greater than or equal to x with the condition that the number of vertices labeled with 0 and the number of vertices labeled with 1 differ by at most 1 and the number of edges labeled with 0 and the number of edges labeled with 1 differ by almost 1. The graph that admits an Extended Mean Cordial Labeling is called Extended Mean Cordial Graph. In this paper, we proved that tree related graphs Hdn, K 1,n , Tgn, are Extended Mean Cordial Graphs.