Imagine we have this graph above and the probability that any edge doesn't exist is p(some given value). What is the probability that A is isolated(Not connected to any other node) given the the probability that edge i doesn't exist is p and we know that at least node is isolated?
I really have no idea how to calculate this because of the condition "at least 1 node is isolated."
This isn't an elegant solution, but I guess it is one. Maybe someone can come up with a better solution later. The only way I can think of solving this is to explicitly count it out. There are 8 edges.
For removing 4 edges, we need some casework.
Putting these altogether, there are
$1+5\times 2 + 15\times 3 - \frac{1}{2}(2+4+2+3+0+3) = 49$
ways to isolate a point.
There are only 2 ways to remove 5 edges so that no vertices are isolated. The remaining edges are shown below:
(AB)(CF)(DE), (AD)(BC)(EF)
So, there are $\binom{8}{5}-2 = 54$ ways to isolate a node.
If more than 5 edges are removed, then at least one vertex will be isolated.
Let $q=1-p$. Then,
\begin{align} P(\text{at least one node isolated}) &= 3p^2q^6 + 20p^3q^5 + 49p^4q^4 + 54p^5q^3 + 28p^6q^2 + 8p^7q + p^8\\ P(\text{A is isolated}) &= p^3\\ P(\text{A isolated}|>0\text{ nodes isolated}) &= \frac{p}{3q^6 + 20pq^5 + 49p^2q^4 + 54p^3q^3 + 28p^4q^2 + 8p^5q + p^6}. \end{align}
Hope there were no mistakes. Make of that what you will.