BibTeX:

@article{IJIRSTV3I4038,
     title={Special Class Extended Mean Corial Graphs},
     author={Dr. A. Nellai Murugan and S. Sonia},
     journal={International Journal for Innovative Research in Science & Technology},
     volume={3},
     number={4},
     pages={51--55},
     year={},
     url={http://www.ijirst.org/articles/IJIRSTV3I4038.pdf},
     publisher={IJIRST (International Journal for Innovative Research in Science & Technology)},
}

Let G = (V,E) be a graphs with p vertices and q edges. An Extended Mean Cordial Labeling of a Graph G with vertex set V is a bijection from V to {-1,0,1} 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 almost 1. The graph that admits an Extended Mean Cordial Labeling is called Extended Mean Cordial Graph. In this paper, we proved that special graphs(umbrella), Q(n),(P_n:C_3) are Extended Mean Cordial Graphs.

Extended Mean Cordial Graph, Extended Mean Cordial Labeling