Path 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 ( (⌈f(u)+f(v))⌉)⁄2 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 at most 1. The graph that admits a Extended Mean Cordial Labeling is called Extended Mean Cordial Graph. In this paper, we proved that Path related graphs Pn2, Pn, PnʘP2, Pn: Sm, S (PN) are Extended Mean Cordial Graphs.