Let G be a (p, q) graph. Let k be an integer with 2 ≤ k ≤ p and f from V (G) to the set {1, 2, . . . , k} be a map. For each edge uv, assign the label |f(u) − f(v)|. The function f is called a k-difference cordial labeling of G if |νf (i) − vf (j)| ≤ 1 and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labelled with x (x ∈ {1, 2 . . . , k}), ef (1) and ef (0) respectively denote the number of edges labelled with 1 and not labelled with 1. A graph with a k-difference cordial labeling is called a k-difference cordial graph. In this paper we investigate the 3-difference cordial labeling of wheel, helms, flower graph, sunflower graph, lotus inside a circle, closed helm, and double wheel.
Ponraj,R and Maria Adaickalam,M . (2016). 3-difference cordial labeling of some cycle related graphs. Journal of Algorithms and Computation, 47(1), 1-10. doi: 10.22059/jac.2016.7927
MLA
Ponraj,R , and Maria Adaickalam,M . "3-difference cordial labeling of some cycle related graphs", Journal of Algorithms and Computation, 47, 1, 2016, 1-10. doi: 10.22059/jac.2016.7927
HARVARD
Ponraj R, Maria Adaickalam M. (2016). '3-difference cordial labeling of some cycle related graphs', Journal of Algorithms and Computation, 47(1), pp. 1-10. doi: 10.22059/jac.2016.7927
CHICAGO
R Ponraj and M Maria Adaickalam, "3-difference cordial labeling of some cycle related graphs," Journal of Algorithms and Computation, 47 1 (2016): 1-10, doi: 10.22059/jac.2016.7927
VANCOUVER
Ponraj R, Maria Adaickalam M. 3-difference cordial labeling of some cycle related graphs. J. Algo. Comp.. 2016;47(1):1-10. doi: 10.22059/jac.2016.7927
