Maximum Spanning Tree
A maximum spanning tree is a spanning tree of a weighted graph having maximum weight. It can be computed by negating the weights for each edge and applying Kruskal's algorithm (Pemmaraju and Skiena, 2003, p. 336).
A maximum spanning tree can be found in the Wolfram Language using the command FindSpanningTree [g].
See also
Kruskal's Algorithm, Minimum Spanning Tree, Spanning TreeExplore with Wolfram|Alpha
WolframAlpha
References
Pemmaraju, S. and Skiena, S. Computational Discrete Mathematics: Combinatorics and Graph Theory in Mathematica. Cambridge, England: Cambridge University Press, pp. 336-337, 2003.Referenced on Wolfram|Alpha
Maximum Spanning TreeCite this as:
Weisstein, Eric W. "Maximum Spanning Tree." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/MaximumSpanningTree.html