in Graph Theory recategorized by
734 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
734 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

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true