Downloads: 133
Research Paper | Mathematics | India | Volume 5 Issue 12, December 2016
Some Results on I-cordial Graph
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
Similar Articles with Keyword 'Cordial labeling'
Downloads: 1 | Weekly Hits: ⮙1 | Monthly Hits: ⮙1
Research Paper, Mathematics, India, Volume 12 Issue 12, December 2023
Pages: 908 - 911Group {1, -1, i, -i} Cordial Labeling of Some Shadow Graphs
M. K. Karthik Chidambaram | S. Athisayanathan | R. Ponraj
Downloads: 131
Research Paper, Mathematics, India, Volume 2 Issue 5, May 2013
Pages: 74 - 77Cordial Labeling of Kn;n related graphs
G. V. Ghodasara [3] | A. H. Rokad [2]