HMC Labeling of Some Special Graphs and Some Shadow Graphs

All the graphs considered in this article are simple and undirected. Let  be a simple undirected Graph. A function    is called Harmonic Mean Cordial if the induced function   defined by   satisfies the condition    and   for any , where   and   denotes the number of vertices and number of edges with label  respectively and   denotes the greatest integer less than or equals to . A Graph  is called Harmonic Mean Cordial graph if it admits Harmonic Mean Cordial labeling. In this article, we have discussed Harmonic Mean Cordial labeling on some graph operations.