Kizspy | Question: 17
(Choose 1 answer)
Are these two graphs isomorphic? If not, what is the reason?
A. No, they are not isomorphic because the edge connecting the two vertices of degree 3 in the graph on the left is a cut edge, and the graph on the right does not have that property B. No, they are not isomorphic because the graph on the left is not connected, and the graph on the right is connected
C. No, they are not isomorphic because they do not have the same number of simple circuits of length 3
D. Yes, they are isomorphic
E. None of the other choices is correct
