4-Difference Cordial Labeling of Cycle and Wheel Related Graphs

S. M. Vaghasiya; G. V. Ghodasara

doi:https://doi.org/10.14445/22315373/IJMTT-V52P589

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 52 | Number 9 | Year 2017 | Article Id. IJMTT-V52P589 | DOI : https://doi.org/10.14445/22315373/IJMTT-V52P589

4-Difference Cordial Labeling of Cycle and Wheel Related Graphs

S. M. Vaghasiya, G. V. Ghodasara

Citation :

S. M. Vaghasiya, G. V. Ghodasara, "4-Difference Cordial Labeling of Cycle and Wheel Related Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 52, no. 9, pp. 622-626, 2017. Crossref, https://doi.org/10.14445/22315373/IJMTT-V52P589

Abstract

Let G be a (p, q) graph. Let k be an integer with 2 ≤ k ≤ p and f : V (G) → {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 |vf (0) − vf (1)| ≤ 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 discuss 4-difference cordial labeling for cycle, wheel, crown, helm and gear graph.

Keywords

Difference cordial labeling, 4- difference cordial labeling.

References

[1] F. Harary, Graph theory, Addision-wesley, Reading, MA (1969).
[2] I. Cahit, On cordial and 3-equitable labelings of graphs, Util. Math., 37(1990), 189-198.
[3] J. A. Gallian, A dynemic survey of graph labeling, The Electronics Journal of Combinatorics, 16(2013), ]DS6 1 - 308.
[4] J. Gross and J. Yellen, Graph theory and its applications, CRC Press, (1999).
[5] R. Ponraj, S. Sathish Narayanan and R. Kala, Difference Cordial Labeling of Graphs, Global Journal of Mathematical Sciences: Theory and Practical, 5 (2013) 185-196.
[6] R. Ponraj, M. Maria Adaickalam and R. Kala, k- difference cordial labeling of graphs, International Journal of Mathematical Combinatorics, 2 (2016), 121-131.
[7] R. Ponraj and M. Maria Adaickalam, 3-difference cordial labeling of some cycle related graphs, Journal of Algorithms and Computation, 47 (2016), 1-10.
[8] S. M. Vaghasiya and G. V. Ghodasara, Difference Cordial of Operational Graph Related to Cycle, International Journal of Advanced Engineering Research and Science, 3 (2016), 236-239.