  For integers $k \geq 2$ and $n \geq k+1$, we prove the following: If $n\cdot
k$ is even, there is a connected $k$-regular graph on $n$ vertices. If $n\cdot
k$ is odd, there is a connected nearly $k$-regular graph on $n$ vertices.
