Fibonacci and Super Fibonacci Graceful Labeling of Some Graphs

S. K. Vaidya

Abstract


Abstract: In the present work we discuss the existence and non-existence of Fibonacci and super Fibonacci graceful labeling for certain graphs. We also show that the graph obtained by switching a vertex in cycle Cn, (where n >= 6 ) is not super Fibonacci graceful but it can be embedded as an induced subgraph of a super Fibonacci graceful graph.
Key words: Graceful Labeling; Fibonacci Graceful Labeling; Super Fibonacci Graceful Labeling

References


Gallian, J.A.,(2010). A Dynamic Survey of Graph Labeling. The Electronics Journal of Combinatorics,17, # DS6.

Gross, J., & Yellen, J. (1998). Graph Theory and Its Applications. CRC Press.

Kathiresan, K.M. & Amutha,S. Fibonacci Graceful Graphs. Accepted for Publication in Ars Combin.

Niven,I. & Zuckerman,H.,(1972). An Introduction to the Theory of Numbers. New Delhi: Wiley Eastern.

Rosa, A.(1967). On Certain Valuation of the Vertices of a Graph. Theory of Graphs, (Internat. Symposium, Rome, July 1966). Gordan and Breach, N.Y. and Dunod Paris. 349-355


Full Text: PDF

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

Reminder
We only use three mailboxes as follows to deal with issues about paper acceptance, payment and submission of electronic versions of our journals to databases:
caooc@hotmail.com; sms@cscanada.net; sms@cscanada.org

Copyright © 2010 Canadian Research & Development Center of Sciences and Cultures
Address: 3-265 Melrose, Montreal, Quebec, Canada H4H 1T2
Http://www.cscanada.net
Http://www.cscanada.org
E-mail:caooc@hotmail.com