adplus-dvertising
frame-decoration

Question

What are the number of spanning trees possible from a graph containing n vertices?

a.

b.

2n

c.

n(n+1)

d.

n⁽ⁿ⁻²⁾

Answer: (d).n⁽ⁿ⁻²⁾

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. What are the number of spanning trees possible from a graph containing n vertices?

Similar Questions

Discover Related MCQs

Q. The best average behavior is shown by

Q. Divide and Conquer is an important algorithm design paradigm based on

Q. What is the time complexity for printing a list of n items to the screen, looking at each item once?

Q. What is the time complexity for taking a list of n items, and comparing every item to every other item?

Q. The knapsack problem is also called as…….problem.

Q. What is the (exact) solution to the travelling salesman problem using dynamic programming (c>1), where c is any constant?

Q. The time complexity for solving the traveling salesman problem via brute-force search takes

Q. The time complexity for finding an item in a sorted array using binary search is

Q. The time complexity of determining a number is odd or even is

Q. The worst case of the job sequencing with deadline is

Q. The postfix expression for the infix expression (A+B*(C+D))/ (F+D*E) is

Q. In Linked list data is stored in

Q. ......................is called self referential structure.

Q. The time complexity for evaluating a postfix expression is

Q. Dequeue is called

Q. Consider the following complete binary tree and find out the height of the tree

Q. In a tree construction which one will suitable and efficient data structure?

Q. Which of following is not true about spanning tree?

Q. B–tree of order M is a tree having which of the following structural property?

Q. In a max heap both the addition and deletion operations can be performed in time