Data Structures | Graph | Question 8

Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is 1/2. What is the expected number of unordered cycles of length three?
(A) 1/8
(B) 1
(C) 7
(D) 8


Answer: (C)

Explanation: A cycle of length 3 can be formed with 3 vertices. There can be total 8C3 ways to pick 3 vertices from 8. The probability that there is an edge between two vertices is 1/2. So expected number of unordered cycles of length 3 = (8C3)*(1/2)^3 = 7

Quiz of this Question



My Personal Notes arrow_drop_up



Practice Tags :

Recommended Posts:



4.5 Average Difficulty : 4.5/5.0
Based on 6 vote(s)






User Actions