Given m amount of edges within a directed graph, is there a systematic way of accounting for all unique possible combinations of said digraph with m edges?
For example, let m=2. By hand, I was able to find 9 unique possible combinations of a digraph with 2 edges. The amount of vertices in each combination varies. As m increases, it is getting harder to do it by hand. Does anyone know of any strategies if given m=3,4,...,n.
Thank you for your time.