Uniformly most reliable three-terminal graph of dense graphs

Sun Xie, Haixing Zhao, Jun Yin

A graph $G$ with $k$ specified target vertices in vertex set is a $k$-terminal graph. The $k$-terminal reliability is the connection probability of the fixed $k$ target vertices in…