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