Calculate probability of isolated nodes after removing edges

44 Views Asked by At

Consider a graph with no isolated nodes that follows this structure:

enter image description here

The graph is a binary tree with additional edges.

How can we calculate the probability that this graph will still have no isolated nodes after removing $k$ random edges?