3-Difference cordial labeling of some path related graphs

3-Difference cordial labeling of some path related graphs

<p>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 |vf (i) − vf (j)| ≤ 1 and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertice...

Full description

Bibliographic Details
Main Authors: R Ponraj, M Maria Adaickalam, R Kala
Format: Article
Language:English
Published: InaCombS; Universitas Jember; dan Universitas Indonesia 2018-06-01
Series:Indonesian Journal of Combinatorics
Subjects:
Cycle
path
triangular snake
quadrilateral snake
difference cordial
Online Access:http://www.ijc.or.id/index.php/ijc/article/view/25

Internet

http://www.ijc.or.id/index.php/ijc/article/view/25

Similar Items