On Fibonacci Cordial Labeling of Some Snake Graphs
##plugins.themes.bootstrap3.article.main##
Let an injective function f from vertex set V of a graph G to the set (F0, F1, F2, ..., Fn), where Fj is jth the Fibonacci number (j=0, 1, ..., n), is said to be Fibonacci cordial labeling 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 |ef(0)- ef(1) ≤ 1, where ef(0) is the number of edges with label 0 and ef(1) is the number of edges with label 1. A graph which admits Fibonacci cordial labeling is called Fibonacci cordial graph.
References
-
Gross JL, Yellen J. Graph theory and its applications. CRC press; 2005 Sep 22.
Google Scholar
1
-
Prasanna NL, Sravanthi K, Sudhakar N. Applications of graph labeling in communication networks. Oriental Journal of Computer Science and Technology. 2014 Apr;7(1):139-45.
Google Scholar
2
-
Rokad AH, Ghodasara GV. Fibonacci cordial labeling of some special graphs. Annals of Pure and Applied Mathematics. 2016; 11(1): 133-144.
Google Scholar
3
-
Meier J, Smith D. Exploring Mathematics: An Engaging Introduction to Proof. Cambridge University Press; 2017.
Google Scholar
4