Fibonacci Cordial Labeling of Some Special Graphs

  • Rokad A
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

An injective function g:V(G)→{F0,F1,F2,...,Fn+1},where Fjis the jth Fibonacci number(j=0,1,...,n+1), is said to be Fibonacci cordial labeling if the induced functiong∗: E(G) →{0,1}defined by g ∗(xy)=(f(x)+f(y)) (mod2) satisfies the condition |eg(1)−eg(0)|≤1. A graph having Fibonacci cordial labeling is called Fibonacci cordialgraph. In this paper, i inspect the existence of Fibonacci Cordial Labeling of DS(Pn),DS(DFn),EdgeduplicationinK1, n,Jointsum ofGl(n),DFn⊕K1,nand ring sum of star graph with cycle with one chord and cycle with two chords respectively.

Cite

CITATION STYLE

APA

Rokad, A. H. (2017). Fibonacci Cordial Labeling of Some Special Graphs. Oriental Journal of Computer Science and Technology, 10(04), 824–828. https://doi.org/10.13005/ojcst/10.04.18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free