Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

How many graphs with vertex degrees (1, 1, 1, 1, 2, 4, 5, 6, 6) are there? Assuming that all vertices and edges are labelled. I know there's a long way to do it by drawing all of them and count. Is there a quicker, combinatoric way?

share|cite|improve this question
The sum of the degrees must be even for there to be any, because each edge adds $2$ to the sum of the degrees. – mjqxxxx Dec 1 '12 at 22:05
There is a software package nauty, by Brendan McKay that can automate the solution of feasible versions of such problems. See in particular the tool geng of that package. – hardmath Dec 1 '12 at 22:09
nauty is used for graph canonical labeling. It comes with a package "geng" which can generate graphs upto isomorphism under certain conditions, but degree sequence is not one of them. – Douglas S. Stones Apr 16 '13 at 23:23
up vote 5 down vote accepted

There are none. By the hand shaking lemma we know that the number of degrees of odd degree must be even.

There are 5 vertices with odd degrees in your graph, these are the ones with degrees:


share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.