Search
Now showing items 1-2 of 2
Vertex-magic total labelings of disconnected graphs
(Journal of Prime Research in Mathematics, 2006)
Let $G$ be a graph with vertex set $V=V(G)$ and edge set $E=E(G)$ and
let $e=\vert E(G) \vert$ and $v=\vert V(G) \vert$.
A one-to-one map $\lambda$ from $V\cup E$ onto the integers
$\{ 1,2, ..., v+e \}$ is called {\it ...
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) ...