Hello group, I have a few questions about combinatorics in sage. Can one do the following in sage?
1) List of all possible labelings of the vertices or the edges of a graph up to isomorphism? Is there a builtin for that kind of enumeration? 2) Assume that I have a group acting on a set of labelled graphs. Is there a way to get the orbits of the group? 3) This is a special case of 2). I would like to list all possible labellings of the vertices (or edges) of a graph up to cyclic rearranging. In other words, I would like to list all possible cyclic orders of the vertices of a graph. Thanks for any help, Nikos --~--~---------~--~----~------------~-------~--~----~ 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://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
