HARMONIC MEAN CORDIAL LABELING OF SOME GRAPHS

HARMONIC MEAN CORDIAL LABELING OF SOME GRAPHS

J. PAREJIYA, D. JANI, Y. HATHI

[PDF]

Abstract. All the graphs considered in this article are simple and undirected. Let G = (V(G), E(G)) be a simple undirected Graph. A function f : V (G) ! f1; 2g is called Harmonic Mean Cordial if the induced function f : E(G) ! f1; 2g defined by f(uv) = b 2f(u)f(v) f(u)+f(v) c satisfies the condition jvf (i)????vf (j)j  1 and jef (i)????ef (j)j  1 for any i; j 2 f1; 2g, where vf (x) and ef (x) denotes the number of vertices and number of edges with label x respectively and bxc denotes the greatest integer less than or equals to x. A Graph G is called Harmonic Mean Cordial graph if it admits Harmonic Mean Cordial labeling. In this article, we have provided some graphs which are not Harmonic Mean Cordial and also we have provided some graphs which are Harmonic Mean Cordial.

Keywords:Harmonic Mean Cordial, cycle, complete bipartite graph, join of two graphs.

AMS Subject Classification:05C78.