  Let $G$ be a graph and let $J=I_c(G)$ be its ideal of covers. The aims of
this work are to study the {\rm v}-number ${\rm v}(J)$ of $J$ and to study when
$J$ is linearly presented using combinatorics and commutative algebra. We
classify when ${\rm v}(J)$ attains its minimum and maximum possible values in
terms of the vertex covers of the graph that satisfy the exchange property. If
the cover ideal of a graph has a linear presentation, we express its v-number
in terms of the covering number of the graph. We show necessary and sufficient
conditions for the graph $\mathcal{G}_J$ of $J$ to be connected. One of our
main theorems shows that if $G$ has no induced 4-cycles, then $J$ is linearly
presented. To prove this theorem, we show three results about unmixed K\"onig
graphs related to some results already in the literature. For unmixed graphs
without $3$- and $5$-cycles, we classify combinatorially when $J$ is linearly
presented, and show that the columns of the linear syzygy matrix of $J$ are
linearly independent if and only if $\mathcal{G}_J$ has no strong $3$-cycles.
