Definition:Component of Graph
Jump to navigation Jump to search
Let $G$ be a graph.
Let $H$ be a subgraph of $G$ such that:
- $H$ is connected
- $H$ is not contained in any connected subgraph of $G$ which has more vertices or edges than $H$ has.
Then $H$ is a component of $G$.
This graph has $4$ components: