[Edit: Do you really mean degree of each edge? or vertex? I am proceeding on the assumption that its the degree of a vertex]

The diameter is the longest distance from any vertex to another vertex.

Start at any vertex. The maximum number of other vertices reachable in one step is .

Maximum reachable in 2 steps is .

Argue that you cannot reach all vertices in 3 steps (so diameter greater than 3.