Search
Now showing items 1-4 of 4
Most wheel related graphs are not vertex magic
(Utilitas Math., 2008)
Suppose $G$ is a finite graph with vertex-set $V(G)$ and edge-set $E(G)$. A one-to-one map $\lambda$ from $V(G)\cup E(G)$ onto the integers $1,2,3, \dots, |V(G)|+|E(G)|$ is called a {\it vertex-magic total labeling}, if ...
On the partition dimension and connected partition dimension of wheels
(Ars Combinatoria, 2007)
Edge-magic total labelings of wheels, fans and friendship graphs
(Bulletins of ICA, 2002)
An edge-magic total labeling on a graph with v vertices and e
edges will be defined as a one-to-one map taking the vertices and
edges onto the integers 1, 2, · · · , v+e with the property that the sum
of the label on ...
On vertex-magic total labeling of some wheel related graphs
(Utilitas Math., 2007)
Let G be a graph with vertex set V = V (G) and edge set E =
E(G) and let e = jE(G)j and v = jV (G)j. A one-to-one map ¸ from
V [ E onto the integers f1; 2; : : : ; v + eg is called vertex-magic total
labeling if there ...