Title of article
4-total mean cordial labeling in subdivision graphs
Author/Authors
Ponraj, R. Sri Paramakalyani College - Alwarkurichi, Tamilnadu, India , Subbulakshmiy, S. Department of Mathematics - Manonmaniam sundarnar university, Abishekapatti, Tirunelveli, Tamilnadu, India , Somasundaram, S. Department of Mathematics - Manonmaniam sundarnar university, Abishekapatti, Tirunelveli, Tamilnadu, India
Pages
11
From page
1
To page
11
Abstract
Let G be a graph. Let f:V(G)→{0,1,2,…,k−1} be a function where k∈N and k>1. For each edge uv, assign the label f(uv)=⌈f(u)+f(v)2⌉. f is called k-total mean cordial labeling of G if |tmf(i)−tmf(j)|≤1, for all i,j∈{0,1,2,…,k−1}, where tmf(x) denotes the total number of vertices and edges labelled with x, x∈{0,1,2,…,k−1}. A graph with admit a k-total mean cordial labeling is called k-total mean cordial graph.
Keywords
corona , subdivision of star , subdivision of bistar , subdivision of comb , subdivision of crown , subdivision of double comb , subdivision of ladder
Journal title
Journal of Algorithms and Computation
Serial Year
2020
Record number
2531496
Link To Document