J. B. Babujee and R. Jagadesh, “Super Edge Bimagic Labeling for Disconnected Graphs,” International Journal of Applied Mathematics & Engineering Sciences, Vol. 2, No. 2, 2008, pp. 171-175.

has been cited by the following article:

• TITLE: New Constructions of Edge Bimagic Graphs from Magic Graphs

  AUTHORS: Jayapal Baskar Babujee, Babitha Suresh

  KEYWORDS: Graph, Labeling, Magic Labeling, Bimagic Labeling, Function

  JOURNAL NAME: Applied Mathematics, Vol.2 No.11, November 30, 2011

  ABSTRACT: An edge magic total labeling of a graph G(V,E) with p vertices and q edges is a bijection f from the set of vertices and edges to such that for every edge uv in E, f(u) + f(uv) + f(v) is a constant k. If there exist two constants k1 and k2 such that the above sum is either k1 or k2, it is said to be an edge bimagic total labeling. A total edge magic (edge bimagic) graph is called a super edge magic (super edge bimagic) if f(V(G)) = . In this paper we define super edge edge-magic labeling and exhibit some interesting constructions related to Edge bimagic total labeling.