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 path between two vertices D) A point or node in a graph
A) A loop on a vertex B) A node's color in a graph C) A vertex with no connections D) A connection between two vertices
A) Depends on the number of vertices B) No C) Yes 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) 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) A graph that can be drawn on a plane without any edge intersections B) A graph with cycles C) A disconnected graph D) A multigraph
A) A loop on a vertex in both graphs B) Two disconnected graphs C) A bijection between their vertex sets that preserves edges D) The same number of vertices in both graphs
A) A graph with only one vertex B) A graph in which a number (weight) is assigned to each edge C) A graph with maximum number of edges D) An undirected graph |