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