We prove that for every integer k >= 1, there exists a connected graph H-k such that v(H-k) = reg(H-k) + k, where v(G) and reg(G) denote the v-number and the (Castelnuovo-Mumford) regularity of a graph G respectively.