#1
What is a graph in mathematics?
A visual representation of data
A type of algebraic equation
A geometric shape
A type of statistical analysis
#2
Which of the following is NOT a type of graph commonly used in mathematics?
Bar graph
Line graph
Circle graph
Rectangle graph
#3
In a graph, what do the vertices represent?
The lines connecting data points
The axes of the graph
The data points themselves
The labels on the graph
#4
What does the slope of a line on a graph represent?
The rate of change
The area under the curve
The y-intercept
The x-intercept
#5
What is the degree of a vertex in a graph?
The number of edges incident to it
The number of vertices adjacent to it
The number of loops attached to it
The number of connected components it belongs to
#6
In a directed graph, what do the edges typically represent?
Connections between vertices without direction
Connections between vertices with direction
Connections between vertices with labels
Connections between vertices with different colors
#7
What is a tree in graph theory?
A graph with no cycles
A graph with cycles
A graph with self-loops
A graph with multiple connected components
#8
What is a bipartite graph?
A graph with only one connected component
A graph with two connected components
A graph whose vertices can be divided into two disjoint sets
A graph with no edges
#9
What is a weighted graph?
A graph where each edge has a value associated with it
A graph with no edges
A graph with only one connected component
A graph with no cycles
#10
What is the minimum spanning tree of a weighted graph?
A tree that spans all vertices of the graph with the minimum possible total edge weight
A tree with the fewest number of edges
A tree with the maximum number of edges
A tree with no cycles
#11
What is a self-loop in a graph?
An edge that connects a vertex to itself
A loop that goes through all vertices exactly once
A loop that goes through all edges exactly once
An edge that connects two vertices with the same label
#12
What is the diameter of a graph?
The maximum distance between any pair of vertices in the graph
The minimum distance between any pair of vertices in the graph
The number of vertices in the graph
The number of edges in the graph
#13
Which of the following is NOT a property of a connected graph?
Every pair of vertices is connected by a path
There are no cycles
There may be isolated vertices
There are no edges
#14
What is an Eulerian path in a graph?
A path that visits every edge exactly once
A path that visits every vertex exactly once
A path that starts and ends at the same vertex
A path that visits every vertex and edge exactly once
#15
What is the chromatic number of a graph?
The maximum number of edges between vertices
The minimum number of edges between vertices
The maximum number of colors needed to color the vertices
The minimum number of colors needed to color the edges
#16
What is a Hamiltonian cycle in a graph?
A cycle that visits every vertex exactly once
A cycle that visits every edge exactly once
A cycle that starts and ends at the same vertex
A cycle that visits every vertex and edge exactly once
#17
What is the adjacency matrix of a graph?
A matrix representing the connections between vertices
A matrix representing the distance between vertices
A matrix representing the degree of vertices
A matrix representing the coordinates of vertices
#18
What is the difference between a simple graph and a multigraph?
A simple graph can have self-loops, while a multigraph cannot
A simple graph cannot have multiple edges between the same pair of vertices, while a multigraph can
A simple graph cannot have cycles, while a multigraph can
A simple graph can have multiple edges between the same pair of vertices, while a multigraph cannot
#19
What is a planar graph?
A graph that can be drawn on a plane without any edges crossing
A graph with no edges
A graph with only one connected component
A graph with no cycles
#20
What is a directed acyclic graph (DAG)?
A graph with no edges
A graph with no cycles
A graph with only one connected component
A graph where all edges point in the same direction
#21
What is the topological sorting of a DAG?
A sorting of the vertices such that for every directed edge uv from vertex u to vertex v, u comes before v in the ordering
A sorting of the edges based on their weights
A sorting of the vertices based on their degrees
A sorting of the vertices based on their labels
#22
What is a strongly connected component (SCC) in a directed graph?
A subset of vertices in which there is a directed path between every pair of vertices
A subset of vertices with the maximum degree
A subset of vertices with the minimum degree
A subset of vertices with no edges between them
#23
What is a cut vertex (articulation point) in a graph?
A vertex whose removal increases the number of connected components in the graph
A vertex whose removal decreases the number of connected components in the graph
A vertex with the maximum degree
A vertex with the minimum degree
#24
What is a bridge in a graph?
An edge whose removal increases the number of connected components in the graph
An edge whose removal decreases the number of connected components in the graph
An edge with the maximum weight
An edge with the minimum weight
#25
What is a k-regular graph?
A graph where each vertex has degree k
A graph with k connected components
A graph with k vertices
A graph with k edges