A Few Results on Fibonacci Cordial Labeling
Udayan M. Prajapati, K. K. Raval · 2020
A graph which admits Fibonacci cordial labeling is called a Fibonacci cordial graph. This chapter shows that a comb graph and helm graph are Fibonacci cordial graphs. A friendship graph is a Fibonacci cordial graph. The chapter considers a simple, finite and undirected graph having a vertex set and an edge set. The Fibonacci sequence can be illustrated by the linear recurrence relation satisfying a specific equation. A cycle admits Fibonacci cordial labeling if and only if the integer number is greater than or equal to three. Different patterns of labeling can be discovered such that the graph admits Fibonacci cordial labeling.