State the number of edges in a minimum spanning tree of a network with 10 vertices.
State the number of edges in a minimum spanning tree of a network with \(n\) vertices.
The following network has 10 vertices: \(A , B , \ldots , J\). The numbers on each edge represent the distances, in miles, between pairs of vertices.
\includegraphics[max width=\textwidth, alt={}, center]{194d16e0-8e05-45c0-8948-99808440ed2a-004_1294_1118_785_445}
Use Kruskal's algorithm to find the minimum spanning tree for the network.