Return to Revisions

I think it is more or less an accident when two digraphs have the same number of simple cycles, because the number of non-isomorphic digraphs is vastly greater than the number of cycle counts. So unless your two digraphs have some other relationship I doubt that there is any general way to make a useful bijection.