Pair Mean Cordial Labeling of Hurdle, Key, Lotus, and Necklace Graphs
Year: 2024
Type: article
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.
Authors: R Ponraj, S Prabhu
Institution: Manonmaniam Sundaranar University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4403412794