  Seymour's Second-Neighborhood Conjecture states that every directed graph
whose underlying graph is simple has at least one vertex $v$ such that the
number of vertices of out-distance $2$ from $v$ is at least as large as the
number of vertices of out-distance $1$ from it. We present alternative
statements of the conjecture in the language of linear algebra.
