Hi, I'm working on a problem for which I have symmetric matrices with arbitrary entries. I'm interpreting these matrices as adjacency matrices where the (i,j) entry gives the color for the i-j edge of a graph, and I need to know if the graphs given by these matrices are isomorphic. My current work around is to split the edges with additional nodes and color these new edge nodes appropriately. I was wondering if edge colorings will be implemented anytime soon into sage, or if someone can suggest a cleaner and more efficient approach.
Thanks, -Dustin Pluta University of California-Davis --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-support URLs: http://sage.math.washington.edu/sage/ and http://sage.scipy.org/sage/ -~----------~----~----~----~------~----~------~--~---
