On the most reliable graphs with fixed redundancy

Rotem Brand, Reuven Cohen, Simi Haber +1

The all-terminal reliability of a graph $G$ is the probability that $G$ remains connected when each edge fails independently with probability $p$. For fixed $n$ and $m$, the unifor…