A study of Fibonacci cordial labeling in structured graph families (Q6920987)

A Fibonacci cordial labeling of a graph \(G\) is an injective function \(f:V(G)\rightarrow\{F_0, F_1, \dots,F_n\}\), where \(F_i\) denotes the \(i^{\text{th}}\) Fibonacci number, such that the induced edge labeling \(f^\ast: E(G)\rightarrow\{0,1\}\), given by \(f^*(uv)=(f(u)+f(v))\pmod 2\), satisfies the balance condition \(|e_f(0)-e_f(1)|\le 1\). Here, \(e_f(0)\) and \(e_f(1)\) represent the number of edges labeled 0 and 1, respectively. A graph that admits such a labeling is termed a Fibonacci cordial graph. In this paper, the authors find the existence and construction of Fibonacci cordial labelings for several families of graphs, including Generalized Petersen graphs, open and closed helm graphs, joint sum graphs, and circulant graphs of small order. Finally, they pose one conjecture regarding circulant graphs of the form \(\Gamma(n,S)\) that admits a Fibonacci cordial labeling for large \(n\).