Recent Advancements in Graph Theory

10A Few Results on Fibonacci Cordial Labeling

U. M. Prajapati

St. Xavier’s College,Ahmedabad, Gujarat (INDIA)E-mail: [e-mail]

K. K. Raval

Department of Mathematics,Gujarat University,Ahmedabad, Gujarat (INDIA)E-mail: [e-mail]

An injective function f: V(G) → {F₀, F₁, F₂, …, F_n}, where F_j is the j^th Fibonacci number is called Fibonacci cordial labeling if the induced function f*: E(G) → {0, 1} defined by f*(uv) = (f(u) + f(v)) (mod2) satisfies the condition that the total number of edges with label 1 and total number of edges with label 0 differ by at most 1. A graph which admits Fibonacci cordial labeling is called a Fibonacci cordial graph. We show that a comb graph and helm graph are Fibonacci cordial graphs. The ...