A) A pie chart B) A mathematical structure consisting of vertices and edges C) A line graph D) A chart or diagram
A) A point or node in a graph B) A path between two vertices C) A line connecting two points in a graph D) A function in graph theory
A) A connection between two vertices B) A vertex with no connections C) A node's color in a graph D) A loop on a vertex
A) Depends on the number of vertices B) No C) Sometimes D) Yes
A) The number of vertices in the graph B) The distance from one vertex to another C) The size of the graph D) The number of edges incident to the vertex
A) A cycle in a graph B) A disconnected graph C) A sequence of edges that connect a sequence of vertices D) An isolated vertex
A) A disconnected graph B) A multigraph C) A graph with cycles D) A graph that can be drawn on a plane without any edge intersections
A) The same number of vertices in both graphs B) Two disconnected graphs C) A loop on a vertex in both graphs D) A bijection between their vertex sets that preserves edges
A) An undirected graph B) A graph with only one vertex C) A graph with maximum number of edges D) A graph in which a number (weight) is assigned to each edge |