In graph theory [Graph theory], a component of an undirected graph [Undirected graph] is a connected [Connected graph] subgraph that is not part of any larger connected subgraph. The components of any graph partition its vertices into disjoint sets, and are the induced subgraphs of those sets. A graph that is itself connected has exactly one component, consisting of the whole graph. Components are sometimes called connected components.
A graph with three components.
Bibliography
“Component (Graph Theory).” 2023. Wikipedia, January. https://en.wikipedia.org/w/index.php?title=Component_(graph_theory)&oldid=1135796679.