Vidyalelo
Data Structure · Q158

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 158

Q158

Consider a complete graph G with 4 vertices. The graph G has . . . . . . . . spanning trees.

A.
15
B.
8
C.
16
Answer
D.
13

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board