Statements (32)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
graph
|
| gptkbp:hasProperty |
no cycles
connected n-1 edges for n vertices unique path between any two vertices |
| https://www.w3.org/2000/01/rdf-schema#label |
Undirected tree
|
| gptkbp:relatedTo |
gptkb:breadth-first_search
gptkb:forest_(graph_theory) gptkb:tree gptkb:Euler's_formula gptkb:planar_graph graph theory depth-first search graph isomorphism graph traversal minimum spanning tree spanning tree rooted tree subtree leaf (graph theory) root (graph theory) vertex degree |
| gptkbp:type |
gptkb:tree_(graph_theory)
graph connected acyclic graph |
| gptkbp:used_in |
computer science
hierarchical modeling data structures phylogenetics network design |
| gptkbp:bfsParent |
gptkb:Tree-Graph
|
| gptkbp:bfsLayer |
7
|