Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02462321n
Noun Concept
Categories: Trees (graph theory), Graph families, Perfect graphs, Graph minor theory
EN
k-tree
EN
In graph theory, a k-tree is an undirected graph formed by starting with a -vertex complete graph and then repeatedly adding vertices in such a way that each added vertex v has exactly k neighbors U such that, together, the k + 1 vertices formed by v and U form a clique. Wikipedia
Definitions
Relations
Sources
EN
In graph theory, a k-tree is an undirected graph formed by starting with a -vertex complete graph and then repeatedly adding vertices in such a way that each added vertex v has exactly k neighbors U such that, together, the k + 1 vertices formed by v and U form a clique. Wikipedia
graph theory model Wikidata
IS A
graph
STUDIED BY
graph theory
Wikipedia
EN
k-tree
Wikidata
EN
k-tree

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