Now this fourth case you might be feeling kind of nervous because a vertex in principle could have edges involving all m minus one of the vertices, so the number of pointers of a single vertex could be theta of N. Also you could have, you know, you do have end verticies that could be theta of N squared and certainly in something like a complete graph you really would have that much. 