Multiple Choice
A graph H is called a(n) ____ of G if V(H) is a subset of V(G) and E(H) is a subset of E(G) ; that is, every vertex of H is a vertex of G, and every edge in H is an edge in G.
A) matrix
B) intersection
C) subgraph
D) union
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q32: A tree in which a particular vertex
Q33: Linked lists cannot be used to implement
Q34: The edges connecting two vertices can be
Q35: We can always traverse an entire graph
Q36: A tree T is called a(n) _
Q38: Let e (u, v) be an edge
Q39: A maximal subset of connected vertices is
Q40: The starting vertex of a shortest path
Q41: Graph theory started in 1736 with the
Q42: A graph might have cycles; therefore, we