Harmonic Mean Cordial labeling of Some Special Graphs and Some Graphs Related to H-graph

Abstract All the graphs considered in this article are simple, connected and undirected. In this paper, we have proved the theorems on Harmonic Mean Cordial labeling 1 of switching of a vertex in a graph, duplication of a central vertex in a path, cycle, triangular snake graph, friendship graph, path union of a path and a cycle and at last, applications of HMC labeling in civil engineering, i.e., in building cable-stayed tied-arch bridges. AMS Classification (2020): 05C78