Some families of 4-total difference cordial graphs
Abstract
Let G be a graph. Let f: V(G) → {0,1,2,...,k − 1} be a map where k ∈ N and k > 1. For each edge uv, assign the label | f(u)− f(v)|. f is called k-total difference cordial labeling of G if td f(i)−td f(j) ≤ 1, i, j ∈ {1,2,...,k} where td f(x) denotes the total number of vertices and the edges labeled with x. A graph with admits a k-total difference cordial labeling is called k-total difference cordial graphs. In this paper we investigate the 4-total difference cordial labeling behaviour of some graphs like Jn,n∪K1,n,Jn,n∪Bn,n,Jn,n∪Pn etc.
Copyright © 2019 R. Ponraj, S. Yesu Doss Philip, R. Kala. 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. Y. D. Philip, R. Kala, Some families of 4-total difference cordial graphs, J. Math. Comput. Sci. 10 (2020), 150–156. https://doi.org/10.28919/jmcs/4301
BibTeX
@article{Ponraj2020,
author = {Ponraj, R. and Philip, S. Yesu Doss and Kala, R.},
title = {Some families of 4-total difference cordial graphs},
journal = {J. Math. Comput. Sci.},
volume = {10},
year = {2020},
pages = {150--156},
doi = {10.28919/jmcs/4301}
}