Let G be an undirected graph. A maximal subset of connected vertices is called a ____ of G.
A) component
B) property
C) solution
D) technique

Question

Quizplus · Accepted Answer

A component of an undirected graph G is a maximal subset of connected vertices, where every pair of vertices within the subset is connected by a path and no additional vertices can be added to the subset without losing its property of connectivity.

Let G Be an Undirected Graph