Now showing items 1-1 of 1

    • On the degrees of a strongly vertex-magic graph 

      Balbuena, C.; Barker, E.; Das, K.C.; Lin, Y.; Miller, M.; Ryan, J.; Slamin; Sugeng, K.A.; Tkac, M. (Discrete Mathematics, 2006)
      Let G=(V ,E) be a finite graph, where |V |=n2 and |E|=e1.A vertex-magic total labeling is a bijection from V ∪E to the set of consecutive integers {1, 2, . . . , n + e} with the property that for every v ∈ V , (v) +w∈N(v) ...