Fibonacci Cordial Labeling of Some Special Families of Graphs

An injective function ݂ from vertex set ‫)ܩ(ܸ‬ of a graph ‫ܩ‬ to the set ‫ܨ{‬ , ‫ܨ‬ ଵ , ‫ܨ‬ ଶ , ⋯ , ‫ܨ‬ }, where ‫ܨ‬ is the ݅ ୲ Fibonacci number (݅ = 0,1, ⋯ , ݊), is said to be Fibonacci cordial labeling if the induced function ݂ * from the edge set ‫)ܩ(ܧ‬ the set {0,1} defined by ݂ * ‫)ݒݑ(‬ = ‫)ݑ(݂(‬ + ‫݀‪))(m‬ݒ(݂‬ 2) satisfies the condition |݁ (0) -݁ (1)| ≤ 1, where ݁ (0) is the number of edges with label 0 and ݁ (1) is the number of edges with label 1.A graph that admits Fibonacci cordial labeling is called Fibonacci cordial graph.In this paper we discuss Fibonacci cordial labeling of the families of complete graphs ‫ܭ‬ , paths ܲ , cycles ‫ܥ‬ , and corona product of ‫ܥ‬ and ‫ܭ‬ for ‫‬ = 1,2, and 3.