How do you illustrate an undirected graph 4 nodes/vertexes, but have them all connected? If you divide the nodes (at any of the nodes of the graph) into two subsets, how would that work or look like?
I tried drawing the undirected graph in C formations, but if the the graph at one of the nodes was divided, another node would end up completely disconnected.
4 node undirected graph with all nodes connected by one hop
Divided into two subsets