Graph Algorithm 21

0. 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.

Forgot your password?

I agree with the Terms.