Graph Theory Quiz

What does a graph G consist of?

• A set of vertices and a set of edges

• A set of weights

• A set of vertices only

• A set of edges only

What is a simple path in a graph?

• A path that visits the same vertex more than once

• A path that does not visit the same vertex more than once

• A path that includes all vertices

• A path that is circular

What is a cycle in graph theory?

• A path that starts and ends at the same vertex

• A path that does not repeat any edges

• A path that connects two vertices

• A path that visits all vertices

What defines a connected graph?

• There are no edges in the graph

• All vertices are isolated

• There is at least one vertex with no edges

• Every pair of distinct vertices has a path between them

What is a complete graph?

• A graph with only one vertex

• A graph with no edges

• A graph where every pair of distinct vertices is connected by an edge

• A graph that is not connected

What is a multigraph?

• A graph that allows multiple edges between the same pair of vertices

• A graph with no edges

• A graph that is complete

• A graph with only one edge

What is a weighted graph?

• A graph with only one vertex

• A graph that is complete

• A graph with no weights

• A graph where edges have numerical values assigned

What is a directed graph?

• A graph where edges have a direction

• A graph with no edges

• A graph that is complete

• A graph with only one vertex

What is a bipartite graph?

• A graph whose vertices can be divided into two disjoint sets

• A graph with no edges

• A graph with only one edge

• A graph that is complete

What characterizes a random graph?

• All edges are the same length

• It has a fixed number of edges

• Edges are generated randomly

• It is a complete graph