Fibonacci Cordial Labeling of Some Special Graphs |
Author(s): |
| Karthikeyan C , Sri krishna college of arts and science; Abinaya M, Sri krishna college of arts and science; Arthi S, Sri krishna college of arts and science; Surya V, Sri krishna college of arts and science; Sreelakshmi KV, Sri krishna college of arts and science |
Keywords: |
| Fibonacci Cordial Labeling |
Abstract |
|
Fibonacci cordial labeling was introduced in this paper. We prove that the graph such as wheel graph w_n bistar Bn,n are Fibonacci cordial graph. 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 |e_f(0) – e_f(1)| ≤ 1, where e_f(0) is the number of edges with label 0and e_f (1) is the number of edges with label 1. In a graph G An injective function f from vertex set V of a graph G to the set {F0, F1, F2, . . . , Fn}, where Fj is the j^th Fibonaccinumber (j = 0, 1, . . . , n), is said to be Fibonacci cordial labeling .A graph which admits Fibonacci cordial Labeling is called Fibonacci cordial graph. In this paper we discuss Fibonacci cordial labeling of different graphs. |
Other Details |
|
Paper ID: IJSRDV5I120228 Published in: Volume : 5, Issue : 12 Publication Date: 01/03/2018 Page(s): 348-350 |
Article Preview |
|
|
|
|
