If there is at least one edge connecting two vertices in a graph, the vertices are
Chapter 0, Problem 4(choose chapter or problem)
If there is at least one edge connecting two vertices in a graph, the vertices are called __________. A sequence of such vertices and the edges connecting them is called a/an __________. If this sequence of vertices and connecting edges begins and ends at the same vertex, it is called a/an __________.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer