Graph Terminology
This quiz will test your understanding of the basic terminology used in graph theory.
Questions
Question 1 Multiple Choice (Single Answer)
What is a graph?
- A collection of vertices and edges
- A collection of vertices and arcs
- A collection of edges and arcs
- A collection of vertices, edges, and arcs
Question 2 Multiple Choice (Single Answer)
What is a vertex?
- A point in a graph
- A line in a graph
- A curve in a graph
- A surface in a graph
Question 3 Multiple Choice (Single Answer)
What is an edge?
- A line in a graph
- A curve in a graph
- A surface in a graph
- A solid in a graph
Question 4 Multiple Choice (Single Answer)
What is a path?
- A sequence of vertices and edges
- A sequence of vertices
- A sequence of edges
- A sequence of vertices and arcs
Question 5 Multiple Choice (Single Answer)
What is a cycle?
- A path that starts and ends at the same vertex
- A path that starts and ends at different vertices
- A path that has no repeated vertices
- A path that has no repeated edges
Question 6 Multiple Choice (Single Answer)
What is a tree?
- A connected graph with no cycles
- A connected graph with at least one cycle
- A disconnected graph with no cycles
- A disconnected graph with at least one cycle
Question 7 Multiple Choice (Single Answer)
What is a forest?
- A collection of trees
- A collection of cycles
- A collection of paths
- A collection of arcs
Question 8 Multiple Choice (Single Answer)
What is a connected graph?
- A graph in which every pair of vertices is connected by a path
- A graph in which every pair of vertices is connected by a cycle
- A graph in which every pair of vertices is connected by an edge
- A graph in which every pair of vertices is connected by an arc
Question 9 Multiple Choice (Single Answer)
What is a disconnected graph?
- A graph in which some pairs of vertices are not connected by a path
- A graph in which some pairs of vertices are not connected by a cycle
- A graph in which some pairs of vertices are not connected by an edge
- A graph in which some pairs of vertices are not connected by an arc
Question 10 Multiple Choice (Single Answer)
What is a complete graph?
- A graph in which every pair of vertices is connected by an edge
- A graph in which every pair of vertices is connected by a cycle
- A graph in which every pair of vertices is connected by a path
- A graph in which every pair of vertices is connected by an arc
Question 11 Multiple Choice (Single Answer)
What is a subgraph?
- A graph that is contained in another graph
- A graph that is not contained in another graph
- A graph that is connected to another graph
- A graph that is disconnected from another graph
Question 12 Multiple Choice (Single Answer)
What is a spanning subgraph?
- A subgraph that contains all of the vertices of the original graph
- A subgraph that contains all of the edges of the original graph
- A subgraph that contains all of the vertices and edges of the original graph
- A subgraph that contains none of the vertices or edges of the original graph
Question 13 Multiple Choice (Single Answer)
What is a weighted graph?
- A graph in which each edge has a weight
- A graph in which each vertex has a weight
- A graph in which each path has a weight
- A graph in which each cycle has a weight
Question 14 Multiple Choice (Single Answer)
What is a directed graph?
- A graph in which each edge has a direction
- A graph in which each vertex has a direction
- A graph in which each path has a direction
- A graph in which each cycle has a direction
Question 15 Multiple Choice (Single Answer)
What is an undirected graph?
- A graph in which each edge does not have a direction
- A graph in which each vertex does not have a direction
- A graph in which each path does not have a direction
- A graph in which each cycle does not have a direction