DIFFERENCE CORDIALITY OF SOME SNAKE GRAPHS
Raja Ponraj, S. Sathish Narayanan · Journal of applied mathematics & informatics · 2014
Let G be a (p, q) graph. Let f be a map from V (G) to {1, 2, ${\ldots}$ , p}. For each edge uv, assign the label ${\mid}f(u)-f( u){\mid}$ . f is called a difference cordial labeling if f is a one to one map and ${\mid}e_f(0)-e_f(1){\mid}{\leq}1$ where $e_f(1)$ and $e_f(0)$ 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.