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