Spanning tree
id:
spanning-tree-201-8358573
title:
Spanning tree
text:
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. If all of the edges of G are also edges of a spanning tree T of G, then G is a tree and is identical to T.
brand slug:
wiki
category slug:
encyclopedia
description:
Tree which includes all vertices of a graph
original url:
https://en.wikipedia.org/wiki/Spanning_tree
date created:
date modified:
2023-12-10T23:16:34Z
main entity:
{"identifier":"Q831672","url":"https://www.wikidata.org/entity/Q831672"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/d/d4/4x4_grid_spanning_tree.svg","width":252,"height":252}
fields total:
13
integrity:
15