On strong digraphs with a unique minimally strong subdigraph

Abstract In this paper we determine the maximum number of edges that a strong digraph can have if it has a unique minimally strong subdigraph. We show that this number equals n ( n -1)/2+1. Furthermore we show that there is, up to an isomorphism, a unique strong digraph which attains this maximum.