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