Testbook Test Series: Graph Theory - Counting

Question

Comments

Is it none of these

---

No it's A

---

Is solution is not provided?

---

It is provided but I am unable to understand

---

I am applying the logic as if we consider complete graph max degree one can have is n-1. But we will choose only two edges so p^2 and (1-p)^n-1-2. Now from remaining n-1 edges we are choosing only 2 edges so it should be     (n-1) C 2.

---

Can you please post the solution?

---

I guess your solution is right.It is done here in the same way.

---

You can take my previous explanation and multiply with n since we are talking about expectation

---

Yes yes.understud your explanation.Thanks