Union of 4-Total Mean Cordial Graph with the Star K1, N
Authors : D. SRIRAM
Volume/Issue : Volume 7 - 2022, Issue 2 - February
Google Scholar : https://tinyurl.com/3zj69wue
Scribd : https://tinyurl.com/3xfcbcfj
DOI : https://doi.org/10.5281/zenodo.10784511
Abstract : Consider (p, q) graph G and define f from the vertex set V (G) to the set Zk where k ∈ N and k > 1. Foreache uv, assign the label f (u)+f (v) 2, Then the function f is called as k-total mean cordial labeling of G if number of vertices and edges labelled by i and not labelled by i differ by at most 1, wherei ∈ {0, 1, 2, · · · , k − 1}. Suppose a graph admits a k-total mean cordial labeling then it is called as k- total mean cordial graph.In this paper we investigate the 4-total mean cordial labeling of G ∪ K1,n where G is a 4-total mean cordial graph.