Reverse super edge-magic strength of banana trees
Summary: A reverse magic labelling of a graph \(G(V,E)\) is a bijection \(f: V\cup E \to \{1, 2, 3, \dots , v + \varepsilon \}\) 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, \dots, v\}\) and \(f(E) = \{v + 1, v + 2, \dots, v + \varepsilon \}\). The reverse super edge-magic strength of a graph \(G\), \(\operatorname{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.
reverse super edge-magic strength of a graph
scientific article