Explanation by: Mr. Dubey
a graph can have many spanning trees. and a complete graph with n vertices has n(n-2) spanning trees. so, the complete graph with 4 vertices has 4(4-2) = 16 spanning trees.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. Suppose you plotted a scatter plot between the residuals and predicted values in linear regression and you found that there is a relationship between

Q. What is the interface circuit?

Q. A characteristic of an entity.

Q. and prediction may be viewed as types of classification

Q. What is the other name for a postfix expression?

Q. The register used to store the flags is called as

Q. The expression 'delayed load' is used in context of

Q. Using spy cameras in malls and shops to capture private parts of any person comes under _______ of IT Act, 2008.

Q. The scale to measure the intensity level of sound is called

Q. A premise may be introduced at any point in the derivation is called ________.

Question analytics