• Support PF! Buy your school textbooks, materials and every day products Here!

Graph Theory

  • Thread starter saubbie
  • Start date
13
0
1. Homework Statement

I have two questions. 1.)There are exactly two nonisomorphic graphs with vertex sequence 3, 3, 3,3, 3, 3, 6. Find them.

2.)Does there exist a connected graph with vertex degrees 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3? If there is, then draw such a graph. If
not, explain why not.

2. Homework Equations

I am still unclear as to what a nonisomorhpic graph is. I think that I may have found them, but how do I check if they are nonisomorphic?


3. The Attempt at a Solution

For the second one, my initial thought is that it is not possible since there are 20 vertexes, and each has degree 3 there will always be two that get left with only degree 2. If there were 21 vertexes, then it would be possible. Any other thoughts or suggestions? Thanks.
 

Answers and Replies

Related Threads for: Graph Theory

  • Last Post
Replies
2
Views
803
  • Last Post
Replies
4
Views
937
  • Last Post
Replies
0
Views
2K
  • Last Post
Replies
0
Views
1K
  • Last Post
Replies
1
Views
2K
  • Last Post
Replies
5
Views
2K
  • Last Post
Replies
0
Views
826
Replies
2
Views
2K
Top