Fibonacci Cordial Labeling of Some Graphs

Authors

  • amit himmatbhai rokad RK University, Rajkot-360020, Gujarat-India

DOI:

https://doi.org/10.37591/rrdms.v5i1.1416

Abstract

An injective function f: V (G) → {F0, F1, F2, . . . , Fn+1}, where Fj is the jth Fibonacci number (j = 0, 1, . . . , n+1), is said to be Fibonacci cordial labeling if the induced function f  : E(G) → {0, 1} defined by f (uv) = (f (u) + f (v))(mod2) satisfies the condition |ef (0) − ef (1)| ≤ 1. A graph which admits Fibonacci cordial labeling is called Fibonacci cordial graph. In this paper, the author investigated the existence of Fibonacci Cordial Labeling of some Graphs.

Author Biography

  • amit himmatbhai rokad, RK University, Rajkot-360020, Gujarat-India

    Applied Science & Humanities

    Assistant Professor

References

Rokad AH, Ghodasara GV. Fibonacci Cordial Labeling of Some Special Graphs. Annals of Pure and Applied Mathematics. 2016; 11(1): 133−144p.

Harary F. Graph theory. Addision-wesley, Reading, MA. 1969.

Gross J, Yellen J. Handbook of graph theory, CRC Press, 2004.

Gallian JA. A dynamic survey of graph labeling. The Electronics Journal of Combinatorics. 2012; 19: DS6 1 – 260p.

Sundaram M, Ponraj R, Somasundram S. Prime cordial labeling of graphs. Journal of Indian Acadamy of Mathematics. 2005; 27: 373–390p.

Seoud MA, Salim MA. Two upper bounds of prime cordial graphs, Journal of Combinatorial Mathematics and Combinatorial Computing. 2010; 75: 95–103p.

Vaidya SK, Vihol PL. Prime cordial labeling for some cycle related graphs. International Journal of Open Problems in Computer Science Mathematics. 2010; 3(5): 223–232p.

Vaidya SK, Vihol PL. Prime cordial labeling for some graphs, Modern Applied Science. 2010; 4(8): 119–126p.

Vaidya SK, Shah NH. Prime cordial labeling of some graphs, Open Journal of Discrete Mathematics. 2012; 2(1): 11–16p. doi:10.4236/ojdm.2012.21003.

Published

2018-04-09

Issue

Section

Research Articles