Compute the number of pairwise non-isomorphic 7-regular graphs on 10 vertices?
- Anybody can ask a question
- Anybody can answer
- The best answers are voted up and rise to the top
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
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.