A) A mathematical structure consisting of vertices and edges B) A line graph C) A pie chart D) A chart or diagram
A) A function in graph theory B) A path between two vertices C) A point or node in a graph D) A line connecting two points in a graph
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 disconnected graph B) A multigraph C) A graph with cycles D) A graph that can be drawn on a plane without any edge intersections
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) A cycle in a graph B) A sequence of edges that connect a sequence of vertices C) An isolated vertex D) A disconnected graph
A) Depends on the number of vertices B) Sometimes C) No D) Yes
A) A graph with only one vertex B) A graph with maximum number of edges C) An undirected graph D) A graph in which a number (weight) is assigned to each edge |