Browsing Abstract Journal by Author "Sugeng, K.A."

Now showing items 1-3 of 3

(a,d)-Edge-Antimagic Total Labelings of Caterpillars

Sugeng, K.A.; Miller, M.; Slamin; Baca, M. (Lecture Notes in Computer Science, 2005)

For a graph G = (V,E), a bijection g from V(G) ∪ E(G) into { 1,2, ..., ∣ V(G) ∣ + ∣ E(G) ∣ } is called (a,d)-edge-antimagic total labeling of G if the edge-weights w(xy) = g(x) + g(y) + g(xy), xy ∈ E(G), form an arithmetic ...
Conjectures and open problems on face antimagic evaluations of graphs

Baca, M.; Baskoro, E. T.; Jendrol, S.; Lin, Y.; Miller, M.; Simanjuntak, R.; Slamin; Sugeng, K.A. (Journal of Indonesian Mathematical Society, 2005)
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) ...