Digraphs with unique minimal king sets

If D is a digraph, then image is a king set of D if image is discrete and for each image there is image such that the directed distance from x to y is less than three. A king set K will be called minimal if no proper subset of K is a king set. We characterize both the digraphs which have a unique king set and those which have a unique minimal king set.