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