A) A mathematical structure consisting of vertices and edges B) A chart or diagram C) A pie chart D) A line graph
A) A line connecting two points in a graph B) A function in graph theory C) A point or node in a graph D) A path between two vertices
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) A multigraph B) A graph that can be drawn on a plane without any edge intersections C) A graph with cycles D) A disconnected graph
A) The distance from one vertex to another B) The size of the graph C) The number of vertices in the graph D) The number of edges incident to the vertex
A) The same number of vertices in both graphs B) A bijection between their vertex sets that preserves edges C) Two disconnected graphs D) A loop on a vertex 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 |