Title: Reverse super edge-magic strength of banana trees

Authors: Shaik Sharief Basha

Addresses: Department of Mathematics, School of Advanced Sciences, VIT University, Vellore, TN-632014, India

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.

Keywords: reverse super edge-magic labelling; reverse super edge-magic strength of a graph; banana trees.

DOI: 10.1504/IJCSM.2018.095503

International Journal of Computing Science and Mathematics, 2018 Vol.9 No.5, pp.515 - 523

Accepted: 19 Jul 2017
Published online: 08 Oct 2018 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article