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
Answer: C
Computer Science & Information Technology
You might also like to view...
Which of the following is the best suggestion when using colors in a document such as a newsletter?
A) try to use just the primary colors B) use colors that complement each other C) use light shades for headings and subheadings; black for body text D) use a wide variety of colors
Computer Science & Information Technology
List three possible symptoms of a problem with a computer's electrical system.
What will be an ideal response?
Computer Science & Information Technology