I'm faced with a problem in my course where I have to calculate the total number of non-isomorphic graphs. The graph is regular with an degree 4 (meaning each vertice has four edges) and has exact 7 vertices in total.
What is the correct way of handling this question?
After drawing a few graphs and messing around I came to the conclusion the graph is quite symmetric when drawn. I mean there is always one vertice you can take where you can draw a line through the graph and split in half and have two equal mirrored pieces of the graph.
If you build further on that and look I noticed you could have up to 45 or more possibilities. But I don't have a final answer and I don't know if I'm doing it right.
Any help would be appreciated. Kind Regards, Floris