An (unweighted) edge is defined by its start and end vertex, so each edge may be represented by two numbers.
A tuple corresponds to one edge.
An edge list may be considered a variation on an Adjacency List. See the following illustration of fundamental graph representations.
Illustration of fundamental graph representations (Adjacency Matrix, Adjacency List, Edge List) and remarks on their usage in dynamic settings.