An injective function f from the vertex set V of a graph G to the                 set  where  is the jth Fibonacci number  is said to be a Fibonacci cordial labeling if          the induced function  from the edge set E of graph G to the set  defined by  satisfies the condition  where  is the number of edges with label 0 and  is the number of edges with label 1.

Fibonacci product cordial graph, Fibonacci product cordial labeling, Ring sum of graphs

Received: September 3, 2022; Accepted: October 15, 2022; Published: November 14, 2022

How to cite this article: J. T. Gondalia, On Fibonacci product cordial labeling in context of vertex switching of graphs, Advances and Applications in Discrete Mathematics 35 (2022), 25-35. http://dx.doi.org/10.17654/0974165822049

References:
[1] I. Cahit, Cordial graphs: a weaker version of graceful and harmonious graphs, Ars. Combin. 23 (1987), 201-207.
[2] J. A. Gallian, A dynamic survey of graph labeling, Electronic J. Combin. 5 (1998) Dynamic Survey 6, 43 pp.
[3] J. Gondalia and R. Amit, Multiply divisor cordial labeling in context of ring sum of graphs, Advances in Mathematics Scientific Journal 9 (2020), 9037-9044. 10.37418/amsj.9.11.8.
[4] J. L. Gross, J. Yellen and M. Anderson, Graph Theory and its Applications, Chapman and Hall/CRC, 2018.
[5] A. Rokad, Fibonacci cordial labeling of some special graphs, Oriental Journal of Computer Science and Technology 10(4) (2017), 824-828.
[6] R. Sridevi, K. Nagarajan, A. Nellaimurugan and S. Navaneethakrishnan, Fibonacci divisor cordial graphs, International Journal of Mathematics and Soft Computing 3(3) (2013), 33-39.
[7] R. Sridevi, S. Navaneethakrishnan and K. Nagarajan, Super Fibonacci graceful labeling, International J. Math. Combin. 3 (2010), 22-40.
[8] Tessymol Abraham and Shiny Jose, Fibonacci product cordial graphs, Journal of Emerging Technologies and Innovative Research 6(1) (2019), 58-63.
[9] S. Vaidya, Fibonacci and super Fibonacci graceful labeling of some graphs, Studies in Mathematical Sciences 2(2) (2011), 24-35.