I have 5 nodes with the degree 2, 2, 2, 3, 5. How do I find all non-isomorphic graphs I can make out of these 5 nodes? All the nodes must be connected with eachother.
One way I think would work would be to bruteforce it by writing a chart for every possibility.
Like if A represents 2, B - 3 and C - 5 and where an X represents an edge.
A A A B C A X X A X X A X X B X X C X 2X
But that seems like it would be hard to not miss/add a graph and takes some time to do. Does any one know a way to do this?
- Loops are allowed
- Multiple edges between same two nodes are allowed