HMC Labeling of Some Snake Graphs

Abstract

A simple graph G = (V, E) is said to be HMC (Harmonic Mean Cordial) labeling if there exist a functionsuch that the induced edge functiondefined by for each edge and , , where  denotes the number of vertices labeled with x , denotes the number of edges labeled with x, whererespectively. A graph which admits a HMC (Harmonic Mean Cordial)labeling is called HMC (Harmonic Mean Cordial) graph. In this paper we investigate HMC (Harmonic Mean Cordial) labeling behaviour of triangular snake, alternate triangular snake, double triangular snake graphs.