Fibonacci Divisor Cordial Labeling of Different Graphs
Keywords:
Divisor Cordial Labeling, Fibonacci Divisor Cordial Labeling, Vertex switching of Path Graph, Graph Theoretic Notations and Terminology, Joint SumAbstract
Fibonacci divisor of graph G with vertex set V (G)-Bijection f: V (G) → {F1, F2 ,. .. .. , Fp}, where Fi is the ith Fibonacci number. Therefore, if label 1 is assigned to each edge uv, if f (u) | f (v) or f (v) | f (u), mark 0 otherwise, then 0. The number of edges marked with 1 differs from the number of edges marked with 1 by up to 1. A graph that admits Fibonacci divisor cordial labeling is called a Fibonacci divisor cordial graph. In this paper I have proved following graphs admit Fibonacci divisor cordial labeling. (1) DFn ⊕ K1, n is Fibonacci divisor cordial graph. (2) Globe Gln is Fibonacci divisor cordial graph. (3) K1,1,n is Fibonacci divisor cordial graph. (4) DS (DFn) is Fibonacci divisor cordial graph. (5) Vertex switching of Path Graph Pn is Fibonacci divisor cordial graph..(6) DS (k1,n) is Fibonacci divisor cordial graph..(7) Jewel graph Jn is Fibonacci divisor cordial graph. (8) Jellyfish graph Jn,n is Fibonacci divisor cordial graph. AMS subject classification: 05C78