A graph is said to be $k$-regular if every vertex has the same degree $k$. For such a graph, what is the relationship between the number of vertices $n$, edges $E$, and $k$?