Perfect Mean Cordial Labeling of [Pn : Sk ] Graphs

Abstract

A vertex labeling h : V(G) → {0,1,2,3} is said to be perfect mean cordial labeling of a graph G if it induces an edge labeling h∗ defined as follows :

with the condition that |e_h(0)−e_h(1)| ≤ 1 and |v_h(α)−v_h(β)| ≤ 1 for all α,β ∈ {0,1,2,3},where eh(δ) is number of edges label with δ(δ = 0,1) and v_h(λ) denote the number of vertices labeled with λ (λ = 0,1,2,3). A graph G is said to be perfect mean cordial graph if it admits a perfect mean cordial labeling. In this paper, we investigate [P_n : S_k ] graphs are perfect mean cordial graphs.