A connected component of an undirected graph $G$ is a subgraph where any two vertices are connected by paths. A connected component is a maximal connected subgraph in $G$.
Consider a complete graph $K_3$ and its subgraphs. I cannot understand the word maximal so I get the following question that I want to get confirmed by the subquestions to be totally certain about the term connected component.
Is a connected component unique?
Is the connected component the triangle graph for all different subgraphs of $K_3$ (yes)?
Does there exist other connected components for some subgraphs of $K_3$?
2.1. Are the V-shaped graphs the connected components of the triangle graph at the top (a path exists to connect all vertices)?
2.2. Or is the only connected component the maximal subgraph, the triangle graph here?
What does the word maximal really mean here? Not required to be unique (so not using the term maximum connected component)? The triangle graph is the maximum connected component of all subgraphs of $K_3$?