A) A mathematical structure consisting of vertices and edges. B) A type of bar graph used for data visualization. C) A drawing or diagram representing mathematical functions. D) A form of abstract art based on geometric shapes.
A) A term used to describe the size of a graph. B) A line connecting two points in a graph. C) A shape formed by connecting vertices in a graph. D) A point or node in a graph.
A) The connections between vertices in a graph. B) The algorithms used to analyze graphs. C) The colors assigned to different regions of a graph. D) The straight lines connecting vertices in a graph.
A) The number of vertices connected to the vertex. B) The number of edges incident to the vertex. C) The distance of the vertex from the center of the graph. D) The size of the vertex in the graph visualization.
A) A loop that starts and ends at the same vertex. B) The visualization of a graph on paper. C) A collection of disconnected vertices. D) A sequence of edges that connect a sequence of vertices.
A) A graph with all vertices having the same degree. B) A graph where each pair of distinct vertices is connected by a unique edge. C) A graph with no edges connecting any pairs of vertices. D) A graph where all vertices are connected to a central vertex.
A) A path that starts and ends at the same vertex. B) A path that visits each vertex exactly once. C) A path that visits every other vertex. D) A path that has the smallest total weight across all edges.
A) Prim's algorithm. B) Breadth-first search. C) Dijkstra's algorithm. D) Depth-first search.
A) A subset of vertices where every pair of vertices is connected by an edge. B) A group of vertices with the highest degree in the graph. C) A disconnected collection of vertices in a graph. D) A subset of vertices not connected by any edges.
A) Assigning colors to vertices so that no adjacent vertices have the same color. B) Coloring a graph's vertices based on their degree. C) Coloring the edges of a graph to highlight paths. D) Assigning random colors to vertices without any restrictions.
A) A tree with branches spanning different parts of the graph. B) A tree that only spans a subset of the vertices in the graph. C) A subgraph that is a tree containing all the vertices of the original graph. D) A tree representing the hierarchy of vertices in the graph.
A) A graph with a single cycle. B) A graph with all vertices connected to a central vertex. C) A graph that can be embedded in the plane without any edges crossing. D) A graph that forms a straight line.
A) The length of the shortest cycle in the graph. B) The total number of edges in the graph. C) The distance between the two furthest vertices in the graph. D) The number of faces in the graph.
A) An edge connecting two vertices with the shortest distance. B) An edge that forms a cycle in the graph. C) An edge that connects the center of a graph to its periphery. D) An edge whose removal increases the number of connected components in the graph.
A) A bipartite graph. B) A complete graph. C) A planar graph. D) A tree.
A) The minimum number of colors needed to color the vertices so that no two adjacent vertices have the same color. B) The number of edges in the graph. C) The number of connected components in the graph. D) The total degree sum of all vertices. |