# DM-Graphs-Q10

+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)$?

reshown Jul 13, 2019