in Graph Theory recategorized by
222 views
4 votes
4 votes
How many non-isomorphic simple undirected graphs are there, each with four vertices and without a cycle?
in Graph Theory recategorized by
222 views

1 Answer

6 votes
6 votes



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

edited by
Answer:

Related questions