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