PMC-LABELING OF SOME CLASSES OF GRAPHS CONTAINING CYCLES

Let be a graph with p vertices and q edges. We have introduced a new graph labeling method using integers and cordial-related works and investigated some graphs for this labeling technique. Using this labeling concept, we have examined the graphs like path, cycle, star, complete graph, comb, and wheel graph. The first research paper on graph theory was published by Leonhard Euler. However, he did not use the word ‘graph’ in his work. In the early stages of the development of the subject, the vertices of a graph were specified as , and the edges were denoted by, . In recent times, several researchers have attempted to provide different types of labeling to the vertices and edges of a graph by identifying the relevant mathematical properties. The present paper provides a novel method of labeling by employing integers, which may form a foundation for future research work. In this paper, we investigate the pair mean cordial labeling behavior of some cycle-related graphs like the ice cream graph, closed web graph, circulant graph, zig-zag chord graph, pentagonal circular ladder, djembe graph, quadrilateral friendship graph, and origami graph.