AbstractBoesch et al. conjectured that for any n and m there exists a uniformly optimal (n,m)–graph Gn,m for all terminal reliability, that is, the all‐terminal reliability of Gn,m is at least as large as the all‐terminal reliability of any other graph G with n vertices and m edges, no matter what the probability of an edge being operational is. Although there are counterexamples known when one restricts attention to simple graphs, the conjecture remains open when one allows parallel edges. We consider the analogous problem for strongly connected reliability, that is, the probability that a digraph contains a spanning strongly connected subdigraph, given that each vertex is operational, but arcs are independently operational with probability p. We show that there do indeed exist uniformly optimal digraphs for strongly connected (n,m)–digraphs. We also show that if one restricts attention to simple digraphs (without parallel arcs) then such uniformly optimal digraphs need not exist. © 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 49(2), 145–151 2007