The answer for question 10a on homework 1:
Can you draw a graph where every vertex has valence of at least 3 but where removing a single edge disconnects the graph?
To make the graph not connected you have to make it so that they do not touch at all. The two squares are like separate islands. Each vertex has a valence of at least three.
--Isabel
No comments:
Post a Comment
Note: Only a member of this blog may post a comment.