Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03789262n
Noun Concept
Categories: Conjectures, Graph theory objects
EN
graceful labeling  Von Koch's Conjecture  graceful graph  Graceful labeling conjecture  graceful tree conjecture
EN
In graph theory, a graceful labeling of a graph with m edges is a labeling of its vertices with some subset of the integers from 0 to m 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 m inclusive. Wikipedia
Definitions
Relations
Sources
EN
In graph theory, a graceful labeling of a graph with m edges is a labeling of its vertices with some subset of the integers from 0 to m 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 m inclusive. Wikipedia
A type of graph labeling Wikipedia Disambiguation
assignment of integer labels to the vertices of a graph that uniquely identifies edges by the difference of their endpoint labels Wikidata
IS A
graph labeling
HAS KIND
path graph
Wikipedia
EN
graceful labeling
Wikidata
EN
graceful labeling
Wikipedia Redirections
EN
graceful graph, Graceful labeling conjecture, graceful tree conjecture, Ringel-Kotzig conjecture, Ringel–Kotzig conjecture, Von Koch's conjecture, Von Koch's Conjecture

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License