subgraph of an undirected graph G that is a tree which includes all of the vertices of G
In the Vinony graph
Vinony's link graph records 150 inbound references to 生成树, and connects out to tree, time complexity and glossary of graph theory terms.
It sits within the topics Axiom of choice, Computational problems in graph theory and Spanning tree.
Vinony links it to 28 Wikipedia language editions.
Wikidata facts
- Image
- Spanning tree - version 1.jpg
Show 4 more facts
- topic's main category
- Category:Spanning tree
- Commons category
- Spanning trees
- studied by
- graph theory
- maintained by WikiProject
- WikiProject Mathematics
Sources (3)
via Wikidata · CC0
Article · 中文
在图论中，無向圖 G 的生成树（英語：Spanning Tree）是具有 G 的全部顶点，但边数最少的連通子圖。 以表示顶点，表示边，若图 和树，有和，那么是的生成树。 一个图的生成树可能有多个。
Abstract from DBpedia / Wikipedia · CC BY-SA
Connections
tree
Entity
time complexity
Entity
glossary of graph theory terms
Entity
mathematics
Entity
International Standard Book Number
Entity
digital object identifier
Entity
matrix
Entity
International Standard Serial Number
Entity
plane
Entity
graph theory
Entity
determinant
Entity
graph
Entity
bibcode
Entity
arXiv
Entity
stack
Entity
randomness
Entity
Dijkstra's algorithm
Entity
axiom of choice
Entity
queue
Entity
Jean-Pierre Serre
Entity