Search
Now showing items 1-2 of 2
Conjectures and open problems on face antimagic evaluations of graphs
(Journal of Indonesian Mathematical Society, 2005)
On the degrees of a strongly vertex-magic graph
(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) ...