Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Recursive_tree> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Recursive_tree abstract "In graph theory, a discipline within mathematics, a recursive tree (i.e., unordered tree) is a non-planar labeled rooted tree. A size-n recursive tree is labeled by distinct integers 1, 2, ..., n, where the labels are strictly increasing starting at the root labeled 1. Recursive trees are non-planar, which means that the children of a particular node are not ordered. E.g. the following two size-three recursive trees are the same. 1 1 / \ = / \ / \ / \ 2 3 3 2Recursive trees also appear in literature under the name Increasing Cayley trees.".
- Recursive_tree wikiPageID "5140949".
- Recursive_tree wikiPageRevisionID "527908768".
- Recursive_tree hasPhotoCollection Recursive_tree.
- Recursive_tree subject Category:Trees_(graph_theory).
- Recursive_tree comment "In graph theory, a discipline within mathematics, a recursive tree (i.e., unordered tree) is a non-planar labeled rooted tree. A size-n recursive tree is labeled by distinct integers 1, 2, ..., n, where the labels are strictly increasing starting at the root labeled 1. Recursive trees are non-planar, which means that the children of a particular node are not ordered. E.g. the following two size-three recursive trees are the same.".
- Recursive_tree label "Recursive tree".
- Recursive_tree sameAs m.0d4nrz.
- Recursive_tree sameAs Q17133279.
- Recursive_tree sameAs Q17133279.
- Recursive_tree wasDerivedFrom Recursive_tree?oldid=527908768.
- Recursive_tree isPrimaryTopicOf Recursive_tree.