The time complexity of BFS is O(V + E), where V represents the number of vertices and E represents the number of edges in the graph. This is because, in the worst-case scenario, BFS visits each vertex and edge once.