Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03217203n
Noun Concept
Categories: Axiom of choice, Spanning tree, Computational problems in graph theory
EN
spanning tree  fundamental cutset  fundamental cycle  spanning forest
EN
In the mathematical field of graph theory, a spanning tree T of an undirected graph G is a subgraph that is a tree which includes all of the vertices of G. In general, a graph may have several spanning trees, but a graph that is not connected will not contain a spanning tree. Wikipedia
English:
networks
mathematics
Definitions
Relations
Sources
EN
In the mathematical field of graph theory, a spanning tree T of an undirected graph G is a subgraph that is a tree which includes all of the vertices of G. In general, a graph may have several spanning trees, but a graph that is not connected will not contain a spanning tree. Wikipedia
Term in the mathematical field of graph theory Wikipedia Disambiguation
Subgraph of an undirected graph G that is a tree which includes all of the vertices of G Wikidata
A tree structure which includes all vertices of a graph. Wiktionary
Tree which includes all vertices of a graph. Wiktionary (translation)
IS A
tree
subgraph
undirected graph
HAS KIND
Random minimal spanning tree
Trémaux tree
minimum spanning tree
STUDIED BY
graph theory
Wikipedia
EN
spanning tree
Wikidata
EN
spanning tree
Wiktionary
EN
spanning tree
Wikipedia Redirections
EN
fundamental cutset, fundamental cycle, spanning forest, Spanning Tree, Spanning tree (mathematics)

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