Intersection Cordial Labeling of Graphs

G. Meena; K. Nagarajan

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

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 51 | Number 3 | Year 2017 | Article Id. IJMTT-V51P521 | DOI : https://doi.org/10.14445/22315373/IJMTT-V51P521

Intersection Cordial Labeling of Graphs

G. Meena, K. Nagarajan

Abstract

An intersection cordial labeling of a graph G with vertex set V is an injection f from V to the power set of {1, 2, . . . , n} such that if each edge uv is assigned the label 1 if f(u) ∩ f(v) 6= ; and 0 otherwise; Then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. If a graph has an intersection cordial labeling, then it is called intersection cordial graph. In this paper, we proved the standard graphs such as path, cycle, wheel, star and some complete bipartite graphs are intersection cordial. We also proved that complete graph is not intersection cordial.

Keywords

Cordial labeling, Intersection cordial labeling, Intersection cordial graphs.

References

[1] I. Cahit, Cordial graphs: A weaker version of graceful and harmonious graphs, Ars combinatoria, 23(1987), 201-207.
[2] I. Cahit, On cordial and 3-equitable labelings of graph, Utilitas Math, 370(1990), 189-198.
[3] I.N.Herstien, Topics in Algebra, Second Edition. John Wiley and Sons, 1999.
[4] J. A. Gallian, A dynamic survey of graph labeling, Electronic Journal of Combinatorics, 16(2009), DS6.
[5] F. Harary, Graph Theory, Addison-Wesley, Reading, Mass, 1972.
[6] D.K. Nathan and K.Nagarajan, Subset Cordial Graphs, International Journal of Mathematical Sciences and Engineering Applications Vol.7(Sep-2013).

Citation :

G. Meena, K. Nagarajan, "Intersection Cordial Labeling of Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 51, no. 3, pp. 167-161, 2017. Crossref, https://doi.org/10.14445/22315373/IJMTT-V51P521