@article{Article_90,

title = {Pair Mean Cordial Labeling of Total Graph of Some Graphs and Prism Related Graphs},

journal = {Communications in Combinatorics, Cryptography & Computer Science},

volume = {2024},

issue = {2},

issn = { 2783-5456 },

year = {2024},

url = {http://cccs.sgh.ac.ir/Articles/2024/issue 2/2-6-PairMeanCordialLabelingofTotalGraphofSomeGraphsandPrismRelatedGraphs.pdf},

author = {R. Ponraj and S. Prabhu and and M. Sivakumar},

keywords = {path, cycle, star, crown, comb, total graph.},

abstract = {Let G = (V, E) be a graph with p vertices and q edges. Define ρ = { p/2 if p is even, (p−1)/2 if p is odd.}, and M = {±1,±2, · · ·±ρ}. Consider a mapping λ : V → M by assigning different labels in M to the different elements of V when p is even and different labels in M to p − 1 elements of V and repeating a label for the remaining one vertex when p is odd. The labeling as defined above is said to be a pair mean cordial labeling if for each edge uv of G, there is a labeling (λ(u)+λ(v))/2 if λ(u)+λ(v) is even and (λ(u)+λ(v)+1)/2 if λ(u) + λ(v) is odd such that |¯Sλ1 −¯Sλc1| ⩽ 1 where ¯Sλ1 and ¯Sλc1 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 a pair mean cordial graph (PMC-graph). In this paper, we investigate the pair mean cordial labeling behavior of some graphs like total graph of path, cycle, star, crown and comb and Also we examine the pair mean cordial labeling behavior of triangular winged prism graph, rectangular winged prism graph, W− graph and irregular pentagonal snake.}

};