Authors: R.Sridevi, S.Navaneethakrishnan, K.Nagarajan
A Smarandache-Fibonacci Triple is a sequence S(n), n ≥ 0 such that S(n) = S(n − 1) + S(n − 2), where S(n) is the Smarandache function for integers n ≥ 0. Certainly, it is a generalization of Fibonacci sequence. A Fibonacci graceful labeling and a super Fi-bonacci graceful labeling on graphs were introduced by Kathiresan and Amutha in 2006. Generally, let G be a (p, q)-graph and S(n)|n ≥ 0 a Smarandache-Fibonacci Triple. An bi-jection f : V (G) → {S(0), S(1), S(2), . . . , S(q)} is said to be a super Smarandache-Fibonacci graceful graph if the induced edge labeling f∗(uv) = |f(u) −f(v)| is a bijection onto the set {S(1), S(2), . . . , S(q)}. Particularly, if S(n), n ≥ 0 is just the Fibonacci sequence Fi, i ≥ 0, such a graph is called a super Fibonacci graceful graph. In this paper, we show that some special class of graphs namely Ftn, Ctn and St m,n are super fibonacci graceful graphs.
Comments: 14 Pages.
Download: PDF
[v1] 2014-03-14 06:26:27
Unique-IP document downloads: 555 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.