Odd-graceful labelings of trees of diameter 5

Details Odd-graceful labelings of trees of diameter 5 Odd-graceful labelings of trees of diameter 5

2008-07-23

arxiv.org/abs/0807.3738v2

Mathematics

Combinatorics

6 pages, 6 figures

Scientific paper

A difference vertex labeling of a graph G is an assignment f of labels to the vertices of G that induces for each edge xy the weight |f(x)-f(y)|. A difference vertex labeling f of a graph G of size n is odd-graceful if f is an injection from V(G) to {0,1,...,2n-1} such that the induced weights are {1,3,...,2n-1}. We show here that any forest whose components are caterpillars is odd-graceful. We also show that every tree of diameter up to five is odd-graceful.

Affiliated with

Also associated with

No associations

Rating

Odd-graceful labelings of trees of diameter 5 does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Odd-graceful labelings of trees of diameter 5, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Odd-graceful labelings of trees of diameter 5 will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1502