A graph on 7 vertices has three connected components: two isolated edges and a path on 3 vertices. In how many ways can the unordered partition \(\{A,B\}\) be chosen?
A bipartite graph is a graph \(G=(V,E)\) whose vertices split into two disjoint sets \(A\) and \(B\) so that every edge \(e\in E\) joins a vertex of \(A\) to one of \(B\).
\[V=A\cup B,\quad A\cap B=\varnothing,\quad |e\cap A|=1\ \text{ for every } e\in E\]