2 publications

• Published Subscription 26 Jun 2018

  Difference Cordial Labeling in context of Joint sum of Graphs

  By amit himmatbhai rokad

  Abstract: Suppose G be a (p, q) graph. Suppose f be a map from f(G) to {1,2,...,p}. For each edge xy assign, the label |f(x) – f(y)|. f is difference cordial if f is 1-1 and |ef(0) – ef(1)| 14≤"> 1, where ef(1) and ef(0) denote the number of edges with labeled 1 except labeled with 1 respectively. A graph which admit difference cordial labeling is called a difference cordial graph. …

  Published in Research & Reviews: Discrete Mathematical Structures · Vol. 5, Issue 1, 2018 · pp. 21–25 Read article →

• Published Subscription 9 Apr 2018

  Fibonacci Cordial Labeling of Some Graphs

  By amit himmatbhai rokad

  Abstract: An injective function f: V (G) → {F0, F1, F2, . . . , Fn+1}, where Fj is the jth Fibonacci number (j = 0, 1, . . . , n+1), is said to be Fibonacci cordial labeling if the induced function f ∗ : E(G) → {0, 1} defined by f ∗(uv) = (f (u) + f (v))(mod2) satisfies the condition |ef (0) − ef (1)| ≤ 1. A …

  Published in Research & Reviews: Discrete Mathematical Structures · Vol. 5, Issue 1, 2018 · pp. 1–4 Read article →