- If a graph has n vertices, then a spanning tree for that graphhas exactly _____ edges. The maximum possible number of edges in agraph with n vertices is______(i.e, a complete graph)
Expert Answer
An answer will be send to you shortly. . . . .
An answer will be send to you shortly. . . . .