The hull number of an oriented graph (Q1415080)

Summary: We present characterizations of connected graphs \(G\) of order \(n \geq 2\) for which \(h^{+}(G) = n\). It is shown that for every two integers \(n\) and \(m\) with \(1 \leq n-1 \leq m \leq \binom{n}{2}\), there exists a connected graph \(G\) of order \(n\) and size \(m\) such that for each integer \(k\) with \(2 \leq k \leq n\), there exists an orientation of \(G\) with hull number \(k\).