Have you taken into account the following? ignature: G1.spanning_trees_count(root_vertex=None)Docstring: Return the number of spanning trees in a graph.
In the case of a digraph, counts the number of spanning out-trees rooted in "root_vertex". Default is to set first vertex as root. El dom, 18 jun 2023 a las 9:00, Georgi Guninski (<[email protected]>) escribió: > I need this for an algorithm, so even pointers to papers > will be appreciated. > > The smallest bug I have is of order 36. > > The attached file has two multi digraphs which are isomorphic, > but have distinct number of spanning trees. > > > print("isomorphic? ",G1.is_isomorphic(G2)) #True > print("equal trees?",G1.spanning_trees_count()==G2.spanning_trees_count()) > #False > iso,map=G1.is_isomorphic(G2,certificate=True) > G3=G1.copy() > G3.relabel(lambda x: map[x]) > print("verify iso",G3==G2) #True > > -- > You received this message because you are subscribed to the Google Groups > "sage-devel" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to [email protected]. > To view this discussion on the web visit > https://groups.google.com/d/msgid/sage-devel/CAGUWgD8LfAhfpRvgafWiL8cSX8-MrEhNbcOu0nKUt%2BGHnKLp3g%40mail.gmail.com > . > -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/sage-devel/CAC2RnLqOK3T1OZwR0qbsJVc8Dv7zjALBcJ%3DEy9CtSG7EV9nbyw%40mail.gmail.com.
