3-difference cordiality of some corona graphs

Abstract

Let G be a (p, q) graph. Let f : V (G) → {1, 2,. .. , k} be a map where k is an integer 2 ≤ k ≤ p. For each edge uv, assign the label |f (u) − f (v)|. f is called k-difference cordial labeling of G if |v f (i) − v f (j)| ≤ 1 and |e f (0) − e f (1)| ≤ 1 where v f (x) denotes the number of vertices labelled with x, e f (1) and e f (0) respectively denote the number of edges labelled with 1 and not labelled with 1. A graph with a k-difference cordial labeling is called a k-difference cordial graph. In this paper we investigate 3-difference cordial labeling behavior of T n¯K1 , T n¯2 K 1 , T n¯K2 , A(T n)¯K 1 , A(T n)¯2K 1 , A(T n)¯K 2. Subjclass 2000 : 05C78.

Strongly Multiplicative Labeling on subdivision of Triangular Snake & Ladder graphs, Cyclic Quadrilateral & Pentagonal snake graphs

“…If = 4, 5 we call cyclic snake as quadrilateral snake and pentagonal snake respectively, where denotes length of the path . Definition 2.8 [11]: The triangular snake is obtained from the path P n by replacing each edge of the path by a triangle C 3 , corona of triangular snakes T n with K 2 .…”