Fibonacci Cordial Labeling of Some Special Graphs
A. H. Rokad · Oriental journal of computer science and technology · 2017
An injective function g:V(G)→{F0,F1,F2,...,Fn+1},where Fjis the jth Fibonacci number(j=0,1,...,n+1), is said to be Fibonacci cordial labeling if the induced functiong∗: E(G) →{0,1}defined by g ∗(xy)=(f(x)+f(y)) (mod2) satisfies the condition |eg(1)−eg(0)|≤1. A graph having Fibonacci cordial labeling is called Fibonacci cordialgraph. In this paper, i inspect the existence of Fibonacci Cordial Labeling of DS(Pn),DS(DFn),EdgeduplicationinK1, n,Jointsum ofGl(n),DFn⊕K1,nand ring sum of star graph with cycle with one chord and cycle with two chords respectively.