Let G be an undirected graph.Let u and v be two vertices in G.Then u and v are called ____ if there is an edge from one to the other.
A) adjacent
B) weighted
C) connected
D) shortest path

Question

Quizplus · Accepted Answer

The definition given in the question matches with the definition of adjacent vertices in an undirected graph. Therefore, option A is the correct choice. Option B may be applicable if the graph is weighted. Option C is a more general term and could be applicable in a different context where there is a path between u and v, but not necessarily an edge. Option D refers to the shortest path between two vertices and is not related to the definition given in the question.

Let G Be an Undirected Graph