Reverse super edge-magic strength of banana trees
by Shaik Sharief Basha
International Journal of Computing Science and Mathematics (IJCSM), Vol. 9, No. 5, 2018

Abstract: A reverse magic labelling of a graph G(V, E) is a bijection f: V ∪ E → {1, 2, 3, ......, v + ε} such that for all edges xy, f(xy) - {f(x) + f(y)} is a constant which is denoted by c(f). A reverse magic labelling of a graph G(V, E) is called reverse super edge-magic labelling of G if f(V) = {1, 2, ...... v} and f(E) = {v + 1, v + 2, ......, v + ε}. The reverse super edge-magic strength of a graph G,rsm(G), is defined as the minimum of all c(f) where the minimum is taken over all reverse edge-magic labelling f of G. In this paper we invented the reverse super edge-magic strength of banana trees.

Online publication date: Mon, 08-Oct-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com