STM Journals Peer-reviewed research from Consortium e-Learning Network

Research & Reviews: Discrete Mathematical Structures

Fibonacci Cordial Labeling of Some Graphs

  1. 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 graph which admits Fibonacci cordial labeling is called Fibonacci cordial graph. In this paper, the author investigated the existence of Fibonacci Cordial Labeling of some Graphs.
Support