Is a subgraph of G always connected
A subgraph of a graph&nbsp;$G$ is any graph that has a subset of $G$'s vertices and a subset of its edges.  In particular, for an graph $G=(V,E)$, the graph $(V,\emptyset)$ is a subgraph that's not connected.