Multiple Choice
A graph G is a pair, G = (V, E) , where V is a finite nonempty set called the set of ____ of G, and the elements of E are the pairs of elements of V.
A) nodes
B) branches
C) vertices
D) edges
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q17: An edge incident on a single vertex
Q18: A tree T is called a(n) _
Q19: The depth first traversal is similar to
Q20: Y is a(n) _ of X if
Q21: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB4785/.jpg" alt=" -A(n) _ ordering
Q23: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB4785/.jpg" alt=" -A(n) _ ordering
Q24: In a graph directed G, for each
Q25: A simple path is a path in
Q26: In a graph G, if the edges
Q27: The _ algorithm gives the shortest distance