I understand that time complexity of BFS in a graph traversal is `O( V + E )` since every vertex and every edge will be explored in the worst case.

Well,is the exact time complexity `v+2E` ??

Every vertex is explored once+ Every adjacent vertices

The sum of the degree of all the vertices in a `graph= No of edges*2= 2E`

Thus the time complexity is `n+2E`..Am i correct?