Graceful Graph
A graph is said to be graceful if you can number the n vertices with the integers from 1 to n and then label each edge with the difference between the numbers at the vertices, in such a way that each edge receives a different label.
See also: Graph.
Subjects: Mathematics


