vertex that can reach every other vertex in the graph, imply every vertex can reach each other? Given an undirected graph G.
If there is a vertex that can reach every other vertex in the graph, does that imply, every other vertex can reach each other?

Yes. If we are trying to find a walk between vertices $v_1$ and $v_2$ in this graph, we can use the fact that there exists a walk from $v_1$ to $V$ and a walk from $v_2$ to $V$ to create a walk from $v_1$ to $v_2$ through the vertex $V$, where $V$ is the vertex that connects to all other vertices.
