This is a still image of the concept map for the term "graph". You can check the actual concept map on the glossary page.
Concept map centered on the idea of a graph. Shows types such as directed, undirected, weighted, unweighted, labeled, dense, sparse, and acyclic graphs. Includes components like vertices, edges, and neighbors, and implementations using adjacency lists or matrices. Also references related problems such as traversal, shortest paths, and topological sort.
Which of the following is true?

None of the above
  • A graph may contain no edges and many vertices
  • A graph may contain many edges and no vertices
  • A graph may contain no edges and no vertices
  • None of the above

Look at these terms on the concept map.