Some Results on I-cordial Graph

T. Nicholas, P. Maya

Abstract: An I-cordial labeling of a graph G (V, E) is an injective map f from V to [-p/2. . p/2]^*or [-p/2. . p/2] as p is even or odd, which induces an edge labeling f* E {0, 1} defined by f* (uv) = 1 if f (u) + f (v) > 0 and f* (uv) = 0 otherwise, such that the number of edges labeled with1and the number of edges labeled with 0 differ atmost by 1. If a graph has I-cordial labeling, then it is called I-cordial graph. In this paper, we introduce the concept of I-cordial labeling and prove that some standard graphs that are I-cordial and some graph that are not I-cordial.

Keywords: Cordial labeling, I-cordial labeling

How to Cite?: T. Nicholas, P. Maya, "Some Results on I-cordial Graph", Volume 5 Issue 12, December 2016, International Journal of Science and Research (IJSR), Pages: 189-193, https://www.ijsr.net/getabstract.php?paperid=ART20163289, DOI: https://dx.doi.org/10.21275/ART20163289