A simple graph G(V,E) admits a reverse super edge bimagic labeling if there exists a bijection function ζ that taking the vertices u,w ∈ V(G) that incident on edge uw such that the sum of vertex labels incident on edge uw is subtracted from edge label are two different constants τ1 and τ2. The reverse edge bimagic labeling is said to be reverse super edge bimagic labeling if the labels of vertices are 1,2, . . . , |V(G)| and the labels of edges are |V(G)|+1, |V(G)|+2, . . . , |V(G)|+|E(G)|. In this paper we investigate that gear graph, dove tail graph, and hibiscus graph admits a reverse super edge bimagic labeling.
Copyrights © 2024