• Home
  • Search
  • Reverse super edge-magic strength of banana trees
  • https://doi.org/10.1504/ijcsm.2018.10016512Copy DOI Icon

Reverse super edge-magic strength of banana trees

Show More
  • Abstract
  • Literature Map
  • Similar Papers
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.

Similar Papers
  • Research Article

Reverse super magic strength of some special graphs

  • Aug 01, 2012
  • Journal of Discrete Mathematical Sciences and Cryptography
  • D G Akka +1
  • Research Article

VERTEX MAGIC AND EDGE MAGIC LABELINGS OF GRAPHS WITH GROUP ELEMENTS

  • Nov 26, 2025
  • International Journal of Applied Mathematics
  • K Easwaran
  • Research Article

Reverse super edge-magic strength of banana trees

  • Jan 01, 2018
  • International Journal of Computing Science and Mathematics
  • Shaik Sharief Basha
  • Research Article
  • Citations1

Identifying the Fetal Heart Rate and gender with Intuitionistic Fuzzy Total edge Magic Labelling

  • Jul 14, 2025
  • Jambura Journal of Biomathematics (JJBM)
  • Pradeepa Aruchamy +4
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.