Hello, I’m using Sagemath to filter some specific graphs from the general graphs using these codes:
“I = graphs(n) for G in I: if G.is_tree(): if (G.cartesian_product(G)).matching(value_only = True) == n*n/2: G.show()” The problem is that there are a large number of graphs to filter particularly when the number of vertices is greater than 16. This takes a long time so. I was wondering if it is possible to create a library with those graphs I received from the code. Then every time I need to use those graphs I can get them from the library and don’t need to run the code all over again. -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-support+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/sage-support/c2ae0eff-a957-4b21-8af5-641db0dfe000%40googlegroups.com.
