PAIR MEAN CORDIAL LABELING OF HURDLE, KEY, LOTUS, AND NECKLACE GRAPHS

Abstract

Let be a graph with vertices and edges. Define and . Consider a mapping by assigning different labels in to the different elements of when is even and different labels in to elements of V and repeating a label for the remaining one vertex when is odd. The labeling as defined above is said to be a pair mean cordial labeling if for each edge of G, there exists a labeling if is even and if is odd such that | |≤1 where and respectively denote the number of edges labeled with 1 and the number of edges not labeled with 1. A graph G for which there is a pair mean cordial labeling is called pair mean cordial graph(PMC-graph). In this paper, we investigate the pair mean cordial labeling of some graphs like hurdle graph, lotus graph, necklace graph, F-tree, Y-tree, subdivided shell graph, uniform bow graph and key graph.

Keywords

• f-tree
• hurdle graph
• key graph
• lotus graph
• necklace graph
• subdivided shell graph
• uniform bow graph,y-tree