222 views
How many non-isomorphic simple undirected graphs are there, each with four vertices and without a cycle?

No two graphs among the six have the same vertex degrees; thus, no two are isomorphic.