International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Since Year 2012 | Open Access | Double Blind Reviewed

ISSN: 2319-7064




Downloads: 133

Research Paper | Mathematics | India | Volume 5 Issue 12, December 2016


Some Results on I-cordial Graph

T. Nicholas [2] | P. Maya [2]


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


Edition: Volume 5 Issue 12, December 2016,


Pages: 189 - 193


How to Cite this Article?

T. Nicholas, P. Maya, "Some Results on I-cordial Graph", International Journal of Science and Research (IJSR), Volume 5 Issue 12, December 2016, pp. 189-193, https://www.ijsr.net/get_abstract.php?paper_id=ART20163289

How to Share this Article?






Similar Articles with Keyword 'Cordial labeling'

Downloads: 131

Research Paper, Mathematics, India, Volume 2 Issue 5, May 2013

Pages: 74 - 77

Cordial Labeling of Kn;n related graphs

G. V. Ghodasara [3] | A. H. Rokad [2]

Share this Article

Downloads: 148

Research Paper, Mathematics, India, Volume 4 Issue 2, February 2015

Pages: 557 - 559

3-Total Super Product Cordial Labeling For Some Graphs

Abha Tenguria | Rinku Verma

Share this Article


Top