Matches in DBpedia 2014 for { ?s ?p In graph theory, a graceful labeling of a graph with m edges is a labeling of its vertices with some subset of the integers between 0 and m inclusive, such that no two vertices share a label, and such that each edge is uniquely identified by the positive, or absolute difference between its endpoints. A graph which admits a graceful labeling is called a graceful graph.The name "graceful labeling" is due to Solomon W.. }
Showing items 1 to 1 of
1
with 100 items per page.
- Graceful_labeling comment "In graph theory, a graceful labeling of a graph with m edges is a labeling of its vertices with some subset of the integers between 0 and m inclusive, such that no two vertices share a label, and such that each edge is uniquely identified by the positive, or absolute difference between its endpoints. A graph which admits a graceful labeling is called a graceful graph.The name "graceful labeling" is due to Solomon W.".