Vol. 7 No. 1 (2023): Vol 7, Iss 1, Year 2023
Articles
Published
June 30, 2023
Keywords
- Perfect mean cordial graph, perfect mean cordial labeling.
How to Cite
Annie Lydia A, & Angel Jebitha MK. (2023). Perfect Mean Cordial Labeling of [Pn : Sk ] Graphs. Journal of Computational Mathematica, 7(1), 073-099. https://doi.org/10.26524/cm164
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 |eh(0)−eh(1)| ≤ 1 and |vh(α)−vh(β)| ≤ 1 for all α,β ∈ {0,1,2,3},where eh(δ) is number of edges label with δ(δ = 0,1) and vh(λ) 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 [Pn : Sk ] graphs are perfect mean cordial graphs.
Downloads
Download data is not yet available.