The fewest number of edges that the connected undirected graph can have is N minus one and the maximum number of edges that a undirected graph with no parallel edges can have is N times N minus one under two better known as N shoes two. 