On Fibonacci Cordial Labeling of Some Snake Graphs

Let an injective function f from vertex set V of a graph G to the set (F0, F1, F2, ..., Fn), where Fj is jth the Fibonacci number (j=0, 1, ..., n), is said to be Fibonacci cordial labeling if the induced function f* from the edge set E of graph G to the set {0,1} defined by  f* (uv) = (f(u)+f(v)) (mod2) satisfies the condition |ef(0)- ef(1) ≤ 1, where ef(0) is the number of edges with label 0 and ef(1) is the number of edges with label 1. A graph which admits Fibonacci cordial labeling is called Fibonacci cordial graph.