Solved

Let V(G) Denote the Set of Vertices, and E(G) Denote

Question 21

Multiple Choice

Let V(G) denote the set of vertices, and E(G) denote the set of edges of a graph G, then if the elements of E are ordered pairs, G is called a directed graph or ____.


A) bigraph
B) d-graph
C) dir-graph
D) digraph

Correct Answer:

verifed

Verified

Unlock this answer now
Get Access to more Verified Answers free of charge

Related Questions

Q16: If the graph represents a highway structure,

Q17: When drawing a graph, the vertices are

Q18: A graph can be represented in computer

Q19: The statement _ declares graphIt to be

Q20: Processing a graph requires the ability to

Q22: A weight free tree T is a

Q23: A _ is a path of nonzero

Q24: The shortest path algorithm, also called a

Q25: How a graph is represented in computer

Q26: A tree T is called a spanning