A) A pie chart B) A chart or diagram C) A mathematical structure consisting of vertices and edges D) A line graph
A) A line connecting two points in a graph B) A point or node in a graph C) A function in graph theory 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) No B) Depends on the number of vertices C) Sometimes D) Yes
A) The number of edges incident to the vertex B) The size of the graph C) The distance from one vertex to another D) The number of vertices in the graph
A) A disconnected graph B) An isolated vertex C) A cycle in a graph D) A sequence of edges that connect a sequence of vertices
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) Two disconnected graphs D) The same number of vertices in both graphs
A) A graph with maximum number of edges B) An undirected graph C) A graph with only one vertex D) A graph in which a number (weight) is assigned to each edge |