Digraphs with unique minimal king sets (Q2581427)

A subset \(K\) of the vertex set \(V(D)\) of a digraph \(D\) is a king set if the subgraph of \(D\) induced by \(K\) is discrete and for each \(y\) in \(V(D) -K\) there is \(x\) in \(K\) such that the directed distance from \(x\) to \(y\) is less than three. A king set is said to be minimal if no proper subset is a king set. The paper characterizes the digraphs having a unique king set, and those having a unique minimal king set.