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