Statements (29)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
graph
|
| gptkbp:edgeCount |
n-k (where n is number of vertices, k is number of components)
|
| gptkbp:generalizes |
gptkb:tree_(graph_theory)
|
| gptkbp:hasApplication |
computer science
combinatorics optimization phylogenetics circuit analysis network design hierarchical clustering |
| gptkbp:hasComponent |
gptkb:tree_(graph_theory)
|
| gptkbp:hasProperty |
contains no cycles
each connected component is a tree |
| gptkbp:hasSpecialCase |
graph
|
| https://www.w3.org/2000/01/rdf-schema#label |
forest (graph theory)
|
| gptkbp:isA |
graph
acyclic graph disjoint union of trees edgeless graph (if no edges) subgraph of a graph |
| gptkbp:isSubgraphOf |
graph
|
| gptkbp:usedIn |
matroid theory
algorithm design data structures minimum spanning forest spanning forest |
| gptkbp:vertices |
n (arbitrary number of vertices)
|
| gptkbp:bfsParent |
gptkb:tree_(graph_theory)
|
| gptkbp:bfsLayer |
6
|