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