What is the space complexity of an adjacency list data structure?

The space complexity of an adjacency list data structure is O(V E), where V is the number of vertices and E is the number of edges in the graph.