A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. The total number of spanning trees that can be drawn using five labelled vertices is:
a. 125
b. 64
c. 36
d. 16
Priya :(June 08, 2019) What is the basic formula for Total number of spanning trees if No. Of vertices are given?
formula to find the total no of spanning tree if no vertices are given is n^(n-2)
Click to Add Comment

Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: