If the elements of E(G) are ordered pairs, G is called a(n) ____ graph.
A) undirected
B) directed
C) weighted
D) spanning

Name: If the elements of E(G) are ordered pairs, G is called a(n) ____ graph. A) undirected B) directed C) weighted D) spanning
Brand: Quizplus
Rating: 4.9 (35 reviews)

Question

Quizplus · Accepted Answer

The use of ordered pairs in E(G) indicates that there is a direction associated with each edge, which means that G is a directed graph.

If the Elements of E(G) Are Ordered Pairs, G Is