Dustin, The best way to get a canonical labeling of a graph right now is to use the function itself, for example:
sage: g = graphs.PetersenGraph() sage: g.canonical_label() Petersen graph: Graph on 10 vertices Also, if you do sage: g.canonical_label?? you can see exactly how the function calls search_tree, and how it gets the labeling out. In fact, if you specify certify=True, you will also get a map, describing the isomorphism from the graph to the canonical label. -- Robert M On Nov 6, 6:52 pm, Dustin <[EMAIL PROTECTED]> wrote: > Hi, > > I'm trying to use sage to get canonical labelings of graphs. The > documentation says that running search tree with lab=True will find > the canonical labeling of the graph, but I'm unclear as to how to > extract this information. Any help is appreciated. > > 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/ -~----------~----~----~----~------~----~------~--~---
