Are there specific terms or adjectives in graph theory to name these two situations?
- Two vertices are non-adjacent (disjoint? I have seen that the term "disjoint" is rather used for paths with non-common vertices or edges).
- Two connected non-adjacent vertices (the shortest path or paths connecting them have a lenght $> 1$).