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