# Find all graphs with valency sequence $(4, 2, 2, 2, 1, 1)$

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)

-

1
The title and the question don’t agree; are you interested in finding one such graph, or in finding all of them? – Brian M. Scott May 31 '12 at 11:34
What following sequences? Can you do something so the title and the body agree, and make sense? – Gerry Myerson May 31 '12 at 11:35

5
Perhaps you should start by considering the vertex of degree 4. Draw it and the 4 neighbors. What can you do next? – John Engbers May 31 '12 at 11:38

## 1 Answer

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:

-

2
– jp26 Jun 1 '12 at 15:50
@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. – Listing Jun 1 '12 at 20:14
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 5, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9412073493003845, "perplexity_flag": "head"}