1 votes 1 votes Graph Theory testbook-test-series graph-theory counting + – Bhagyashree Mukherje asked Jul 14, 2018 • edited Mar 12, 2019 by ajaysoni1924 Bhagyashree Mukherje 502 views answer comment Share Follow See all 9 Comments See all 9 9 Comments reply Abhinavg commented Jul 15, 2018 reply Follow Share Is it none of these 0 votes 0 votes Bhagyashree Mukherje commented Jul 15, 2018 reply Follow Share No it's A 0 votes 0 votes rajatmyname commented Aug 15, 2018 reply Follow Share Is solution is not provided? 0 votes 0 votes Bhagyashree Mukherje commented Aug 15, 2018 reply Follow Share It is provided but I am unable to understand 0 votes 0 votes rajatmyname commented Aug 15, 2018 reply Follow Share 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. 1 votes 1 votes rajatmyname commented Aug 15, 2018 reply Follow Share Can you please post the solution? 0 votes 0 votes Bhagyashree Mukherje commented Aug 15, 2018 reply Follow Share I guess your solution is right.It is done here in the same way. 0 votes 0 votes rajatmyname commented Aug 15, 2018 reply Follow Share You can take my previous explanation and multiply with n since we are talking about expectation 0 votes 0 votes Bhagyashree Mukherje commented Aug 15, 2018 reply Follow Share Yes yes.understud your explanation.Thanks 0 votes 0 votes Please log in or register to add a comment.