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