# Graceful Graphs

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

A graceful graph has edges labeled 1 to , with each edge label equal to the absolute difference between the labels of its vertices. (Assume one vertex is labeled 0 and no two vertex labels are the same.)

[more]
Contributed by: Ed Pegg Jr (December 2011)

Open content licensed under CC BY-NC-SA

## Snapshots

## Details

## Permanent Citation