+1 vote

G(V,E) is a simple graph with 8 vertices. The edges of G are decided by tossing the coin for each two vertex combination. Edge is added between any 2 vertices iff head is turned up. Expected number of edges in the graph G(V,E)?

asked Jul 12 in Discrete Maths by gbeditor (23,750 points)
reshown Jul 13 by gbeditor

1 Answer

+2 votes
it follows the binomial theorem so mean is np

n=8C2 and p =1/2 mean =np


answer should be 14
answered Jul 14 by tshimanshukashyap1122 (850 points)
if anyone wants to join discussion group