SOLUTION: prove that every path is gracefull.

Question 475379: prove that every path is gracefull.
Answer by richard1234(7193) (Show Source): You can put this solution on YOUR website!
Label a path with three vertices:

1--3--2

A path with four vertices:

1--4--2--3

A path with five vertices:

1--5--2--4--3

In general, label an n-sided graph with the numbers 1, n, 2, n-1, 3, n-2,..., in which the differences between consecutive nodes are n-1, n-2, ..., 1, hence, graceful.

The following website gives more information about graceful graphs:
http://mathworld.wolfram.com/GracefulGraph.html
RELATED QUESTIONS
prove that every set is a subset of... (answered by richard1234)

Grade of a path. What is the approximate grade (expressed in a percentage) of a path that (answered by richard1234)

Prove that for every positive integer n, n3 + n is... (answered by jim_thompson5910)

prove that for every positive integer n, n3 + n is even (answered by solver91311)

Prove that one of every three consecutive positive numbers is divisible by 3 (answered by addingup)

Prove that (5n)!/ 40^n * n! is natural number for every natural number... (answered by greenestamps)

Prove that sin60/cos60=tan60. Please explain every... (answered by Alan3354)

Prove by induction and through divisibility algorithm that 11^n - 6 is divisible by 5... (answered by ikleyn)

Let p€X be arbitrary and Ap be its path component. Then Ap is the largest path... (answered by ikleyn)