Data Structures and Algorithms - Graph Algorithm

Avatto > > UGC NET COMPUTER SCIENCE > > PRACTICE QUESTIONS > > Data Structures and Algorithms > > Graph Algorithm

21. What is the largest integer m such that every simple connected graph with n vertices and n edges contains at least m different spanning trees?

Answer
Comment
Array

Option : C
Explanation :
If E = V then graph is a simple cycle
∵ to create simple cycle minimum 3 vertex should be in graph so the number of spanning trees will be atleast 3.

You must be logged in to post a comment.

You must be logged in to post a comment.

Related Quiz.
Graph Algorithm

Forgot your password?

I agree with the Terms.