Advanced
DIFFERENCE CORDIALITY OF SOME SNAKE GRAPHS
DIFFERENCE CORDIALITY OF SOME SNAKE GRAPHS
Journal of applied mathematics & informatics. 2014. May, 32(3_4): 377-387
  • Received : May 13, 2013
  • Published : May 30, 2014
Download
PDF
e-PUB
PubReader
PPT
Export by style
Article
Author
Metrics
Cited by
TagCloud
About the Authors
Ponraj R.
Narayanan S. Sathish

Abstract
Let G be a (p, q) graph. Let f be a map from V (G) to {1, 2, <TEX>${\ldots}$</TEX>, p}. For each edge uv, assign the label <TEX>${\mid}f(u)-f(\nu){\mid}$</TEX>. f is called a difference cordial labeling if f is a one to one map and <TEX>${\mid}e_f(0)-e_f(1){\mid}{\leq}1$</TEX> where <TEX>$e_f(1)$</TEX> and <TEX>$e_f(0)$</TEX> denote the number of edges labeled with 1 and not labeled with 1 respectively. A graph with admits a difference cordial labeling is called a difference cordial graph. In this paper, we investigate the difference cordial labeling behavior of triangular snake, Quadrilateral snake, double triangular snake, double quadrilateral snake and alternate snakes.
Keywords
References