0
$\begingroup$

Test the following sequences using to see if they are graphical or not: (if they are graphical draw an exemplar graph having that valency sequence)

  • 5
    Perhaps you should start by considering the vertex of degree 4. Draw it and the 4 neighbors. What can you do next?2012-05-31

1 Answers 1

3

There is an algorithm to easily verify valency sequences.

Enumering all possible graphs is a slightly more difficult problem. As there are only a few graphs with 6 nodes you can however figure out that there are only 2 possible graphs with that sequence: (you can modify the algorithm to give you all possible graphs)

Graphs 1 and 2:

enter image description here

  • 0
    @jp26 neat to see that you are using stackexchange too. I found your description of the algorithm very straight forward and easy to understand, so I linked it.2012-06-01