A common model of robustness of a graph against random failures has all vertices operational, but the edges independently operational with probability
. One can ask for the probability that all vertices can communicate (
all‐terminal reliability) or that two specific vertices (or
terminals) can communicate with each other (
two‐terminal reliability). A relatively new measure is
split reliability...