Opening the paper…
Figure from the original question paper What is the weight of a minimum cost spanning tree of the given graph ? Figure from the original question paper An undirected graph *G* has 8 edges. If the degree of each vertex is 2, then find the number of vertices in *G*.