Now showing items 1-1 of 1

    • Super edge-antimagicness for a class of disconnected graphs 

      Dafik, M Mirka, J Ryan, M Baca (CIAO (Center for Informatics and Applied Optimisation), ITMS (School of Information Technology and Mathematical Science), University of Ballarat Australia., 2006-07-13)
      A graph G of order p and size q is called an (a,d)-edge-antimagic total if there exist a bijection f : V (G) U E(G) ---> {1, 2, ...., p + q} such that the edge-weights, w(uv) = f(u) + f(v) + f(uv); uv in E(G), form an ...