vertex of the graph
The SpanningTree command returns a spanning tree of G, a subgraph that contains all the vertices and is a tree. Edge weights are ignored.
To compute a minimal-weight spanning tree for a weighted graph, use MinimalSpanningTree.
P ≔ PetersenGraph⁡
P≔Graph 1: an undirected unweighted graph with 10 vertices and 15 edge(s)
T1 ≔ SpanningTree⁡P
T1≔Graph 2: an undirected unweighted graph with 10 vertices and 9 edge(s)
T2 ≔ SpanningTree⁡P,5:
Download Help Document
What kind of issue would you like to report? (Optional)