Consider a complete graph G with 4 vertices. The graph G has spanning trees.

Mr. Dubey • 52.30K Points
Coach

Q. Consider a complete graph G with 4 vertices. The graph G has          spanning trees.

(A) 15

(B) 8

(D) 13

Correct : Option (C)

Explanation:

 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.

Discusssion

Be the first to start discuss.

Q. The first machine to successfully perform a long series of arithmetic and logical operations was:

Q. >>>print("A", end = ' ')

Q. Which command is used to set limits on file size

Q. What SQL structure is used to limit column values of a table?

Q. The full form of CTDL is

Q. deals with the green credentials of the asset in terms of its design and development.

Q. Determine the validity of the following argument: S1: all my friends are musicians. S2: John is my friend. S3: None of my neighbours are musicians. S:

Q. Prediction can be viewed as forecasting a value

Q. A multiplexer is a logic circuit that

Q. Consider a complete graph G with 4 vertices. The graph G has spanning trees.

Discusssion

Related MCQs