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