A bijection between the edge set of a graph
and the
set
,
where is the number
of edges of
, is called an
antimagic labeling for
if when we sum up the labels of the edges incident to a vertex, different vertices have
different sums. Hartsfield and Ringel conjectured that every tree other than an edge
has an antimagic labeling. Liang, Wong, and Zhu proved that every tree
contains at most one vertex of degree-2 is antimagic. Moreover, if a tree
contains no vertex of degree-2, then subdividing every edge once yields a
new tree that is also antimagic. In this paper, we prove that for any tree
with
at most one vertex of degree-2, the tree obtained by subdividing all edges of
the
same number of times is antimagic.
PDF Access Denied
We have not been able to recognize your IP address
216.73.217.26
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.