Fibonacci Sum Labeling of Some Standard Graphs

Monika. K1 and Murugan. K2

1Department of Mathematics, Manonmaniam Sundaranar University College, Govindaperi, Tirunelveli, Tamilnadu, INDIA. 2Department of Mathematics, The M.D.T Hindu College, Tirunelveli, Tamilnadu, INDIA. email: kmonikalyani@gmail.com, muruganmdt@gmail.com Affiliated to Manonmaniam Sundaranar University, Abishekapatti, Tirunelveli-627012, Tamilnadu


The concept of Fibonacci graceful and super Fibonacci graceful labeling was studied by Kathiresan et al.8 in 2006. This motivates the authors to introduce Fibonacci sum labeling and is defined as follows: A (p,q) graph G=(V,E) is said to be a Fibonacci sum graph if there exists an injective function f:V(G)-->{-1,0,1,2,…,Fq} (Where Fq is the qth Fibonacci number) is said to be Fibonacci sum if the induced edge labeling f*:E(G)->{F1,F2,…,Fq} defined by f*(uv)=f(u)+f(v)uvE(G) is bijective. A graph that admits Fibonacci sum labeling is called a Fibonacci sum graph. In this paper, the Fibonacci sum labeling of some standard graphs are established. 2010 Mathematics Subject Classification: 05C78.

Keywords :Fibonacci sum graph, Fibonacci sum labeling.

map1 map2 map3