Find the number of connected graphs with four vertices

$\begingroup$

My book has the question

Find the number of connected graphs with four vertices. (Draw them)

My understanding of connected graphs is that these are graphs were it is possible to get from every vertex in the graph to every other vertex in the graph.

The book says the answer is $5$ graphs and gives the below graphs

But what I am trying to understand is why connected graphs like below don't count but the ones above do?

Edit: Graph c and h is isomorphic. Graph f and g is isomorphic. Isn't graph a and b isomorphic as well? And c is isomorphic with f?

$\endgroup$ 1

2 Answers

$\begingroup$

Your first graph above and the third graph below are the same i.e. isomorphic. The first two graphs below are also isomorphic. This had to be included in the first list however making a total of $6$.

$\endgroup$ 3 $\begingroup$

The first and second you put are the same graph, disentangle the second. The third one is the same as the first one on the list. Now, the first one you have should be in the list and there should be $6$ graphs.

$\endgroup$

Your Answer

Sign up or log in

Sign up using Google Sign up using Facebook Sign up using Email and Password Submit

Post as a guest

Post Your Answer Discard

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy