4-total difference cordial labeling of corona of snake graphs with K1
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 |tdf(i)−tdf(j)|≤ 1, i, j ∈{0,1,2,...,k−1} where tdf(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 corona of snake graphs with K1.
Copyright © 2020 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. Yesu Doss Philip, R. Kala, 4-total difference cordial labeling of corona of snake graphs with K1, J. Math. Comput. Sci. 10 (2020), 881–890. https://doi.org/10.28919/jmcs/4540
BibTeX
@article{Ponraj2020,
author = {Ponraj, R. and Yesu Doss Philip, S. and Kala, R.},
title = {4-total difference cordial labeling of corona of snake graphs with K1},
journal = {J. Math. Comput. Sci.},
volume = {10},
year = {2020},
pages = {881--890},
doi = {10.28919/jmcs/4540}
}