k-Total mean cordial graphs
Abstract
Let G be a (p,q) graph. Let f: V (G) → {0,1,2,3,..., 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 |tm f(i)−tm f(j)| ≤ 1, i, j ∈ {0,1,2,..., k −1}, where tm f(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.
Copyright © 2020 R. Ponraj, S. Subbulakshmi, S. Somasundaram. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Cite this article
R. Ponraj, S. Subbulakshmi, S. Somasundaram, k-Total mean cordial graphs, J. Math. Comput. Sci. 10 (2020), 1697–1711. https://doi.org/10.28919/jmcs/4742
BibTeX
@article{Ponraj2020,
author = {Ponraj, R. and Subbulakshmi, S. and Somasundaram, S.},
title = {k-Total mean cordial graphs},
journal = {J. Math. Comput. Sci.},
volume = {10},
year = {2020},
pages = {1697--1711},
doi = {10.28919/jmcs/4742}
}