1.

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?(A) 1(B) 2(C) 3(D) n

Answer»


Discussion

No Comment Found

Related InterviewSolutions