Take the 2-minute tour ×
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.

Compute the number of pairwise non-isomorphic 7-regular graphs on 10 vertices?

share|improve this question
4  
What have you tried? Also, it is usually best not to phrase your question in the form of a command. The question may be to compute something, but you're basically telling us to do it for you. At least say, "I'm stuck on this, can any one please help?" or something like that. –  Graphth Oct 20 '12 at 14:14
add comment

2 Answers 2

You do that by looking at the complement, the graph of missing edges.

share|improve this answer
add comment

If you're interested in this question from a computational mathematics point of view (and this is a specific instance of a broader problem), then this can be computed using Brendan McKay's geng (part of the gtools package, which can be downloaded with nauty). Specifically:

geng -n 10 -d7 -D7

computes the number of non-isomorphic graphs with $10$ vertices, minimum degree $7$ and maximum degree $7$.

If you want to understand why the number is what it is, Hendrik Jan's hint is excellent.

share|improve this answer
add comment

Your Answer

 
discard

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.