This is a really basic question, but it is one I never really thought about until now.
Let $\mathscr{G}$ be a tree. Then every pair of vertices in $\mathscr{G}$ is connected by a unique walk.
We are asked to prove the converse which is worded as:
If any two vertices of $\mathscr{G}$ are joined by a unique walk, then $\mathscr{G}$ is a tree.
My question is whether the author means that if we can find a single pair of vertices that are joined by a unique walk in a graph (that may not be a tree), then we know $\mathscr{G}$ is a tree (which obviously is not true), or if he means something more a long the lines of "for all pairs of two vertices in $\mathscr{G}$".
Similarly, he asks us to prove:
If $\mathscr{G}$ is connected but becomes disconnected by the removal of any one edge, then $\mathscr{G}$ is a tree.
Again, in one case it is easy to find counterexamples of graphs with cycles (not trees) that can become disconnected by the removal of one of their edges, but if he wants us to prove that "if, for every edge, the removal of that edge will result in a disconnected graph, then the graph is a tree", the proof while also simple is very, very different.
I come from a more applied background and am not used to this kind of wording. Any insight would be much appreciated.