605 views
1 votes
1 votes
Ram draws an empty graph of 6 nodes and tosses a fair die for every pair of distinct nodes, if a prime number occurs he draws an edge between the respective pair otherwise he moves on without drawing edge between that pair. What is the probability that after the end of the experiment a randomly chosen node will have degree 2?

(a) 5/16

(b) 1/2

(c) 3/8

(d) None of the above

1 Answer

0 votes
0 votes
This problem reduce to find the triangle with 6 vertices. there must be the three node with either 3 or 5 outcomes (3,3,5) or (5,5,3) or  more but not more than that, if the prime outcomes is more than three it will lead to K4, K5, or K6 so we only focus on K3 which is a cycle of three edges.

we know that the number of cycle 3 with n vertices is n(n-1)(n-2)/6 = 6*5*4/5 = 20
and total number of graph formed with probability is (1+1)^6 = 64

so 20/64 = 5/16

Related questions

1 votes
1 votes
1 answer
3
4 votes
4 votes
3 answers
4