Some Star related I-cordial graphs

  • T. Nicholas St. Jude’s College Thoothoor
  • P. Maya Ponjesly College of Engineering
Keywords: Cordial labeling, I-cordial labeling

Abstract

An I-cordial labeling of a graph G = (V, E) is an injective map f from V to *

 

 

+

or
* ⌊


⌋ ⌊


⌋+ as p is even or odd, respectively be an injective mapping such that f(u) + f(v) ≠ 0
and induces an edge labeling f*
: E → {0, 1} where, 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 at most by 1. If a graph has I-cordial labeling, then it is called I-cordial graph.In this
paper, we prove that Bm,n, S'(Bn,n), D2(Bm,n) are I-cordial; Kn,n is I-cordial only if n is even ; Km,n
is I-cordial only if m or n is even and Bn,n
2
is not I-cordial.

Downloads

Download data is not yet available.

Author Biographies

T. Nicholas, St. Jude’s College Thoothoor

Department of Mathematics
St. Jude’s College Thoothoor – 629176
Kanyakumari, Tamil Nadu, India.

P. Maya, Ponjesly College of Engineering

Department of Mathematics
Ponjesly College of Engineering
Nagercoil - 629003, Tamil Nadu, India.

Published
2016-12-31
How to Cite
Nicholas, T., & Maya, P. (2016). Some Star related I-cordial graphs. IJRDO -JOURNAL OF MATHEMATICS, 2(12), 01-16. https://doi.org/10.53555/m.v2i12.1569