Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Spanning Tree
CHF 43.15
Auf Lager
SKU
LUBOFL5LBK4
1 Verfügbar 
Geliefert zwischen Mi., 28.01.2026 und Do., 29.01.2026
Details
High Quality Content by WIKIPEDIA articles! In the mathematical field of graph theory, a spanning tree T of a connected, undirected graph G is a tree composed of all the vertices and some (or perhaps all) of the edges of G. Informally, a spanning tree of G is a selection of edges of G that form a tree spanning every vertex. That is, every vertex lies in the tree, but no cycles (or loops) are formed. On the other hand, every bridge of G must belong to T. A spanning tree of a connected graph G can also be defined as a maximal set of edges of G that contains no cycle, or as a minimal set of edges that connect all vertices. In certain fields of graph theory it is often useful to find a minimum spanning tree of a weighted graph.Adding just one edge to a spanning tree will create a cycle; such a cycle is called a fundamental cycle. There is a distinct fundamental cycle for each edge; thus, there is a one-to-one correspondence between fundamental cycles and edges not in the spanning tree.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786131197093
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- EAN 9786131197093
- Format Fachbuch
- Titel Spanning Tree
- Herausgeber Betascript Publishing
- Anzahl Seiten 84
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
