What:

A Graph G is a subgraph such that any two vertices are connected via some path.

Example: