Given a graph
, a
-total difference labeling of
the graph is a total labeling
from the set of edges and vertices to the set
satisfying
for any
edge
. If
is a graph, then
is the minimum
such that there is
a
-total difference
labeling of
in which no two adjacent labels are identical. We extend prior
work on total difference labeling by improving the upper bound on
and
also by proving results concerning infinite regular graphs.
PDF Access Denied
We have not been able to recognize your IP address
35.173.48.18
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.