In this paper, we introduce a new concept of reverse super edge-magic labeling and reverse super edge-magic strength of a graph G. A graph G is said to be reverse super edge-magic if there exists a bijection such that is a constant, for all and Such a bijection is called a reverse super edge-magic labeling and the minimum of all constants is called a reverse super edge-magic strength of the graph G, where the minimum is taken over all reverse super edge-magic labelings of G. Also, we obtain the reverse super edge-magic labelings and reverse super edge-magic strength of some well known graphs such as the path the tree the bistar the tree and the banana tree
