Graceful labeling
Summary
In graph theory, a graceful labeling of a graph with edges is a labeling of its vertices with some subset of the integers from 0 to inclusive, such that no two vertices share a label, and each edge is uniquely identified by the absolute difference between its endpoints, such that this magnitude lies between 1 and inclusive. A graph which admits a graceful labeling is called a graceful graph.
Further reading
- Wikipedia, page 8978968, revision 1365285331, Graceful labeling. adopted
About this page
| Tag | CJXGKY5WMQ |
|---|---|
| URI | m2://CJXGKY5WMQ |
| Aliases | graceful-graph, graceful-labeling-conjecture, ringel-kotzig-conjecture, von-kochs-conjecture |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.