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