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