Hello, These functions do not take edge labels into account. When the documentation says that it counts/enumerates/find 'labeled' copies of a graph, it means precisely that the number of copies of a graph G in itself is equal to the size of Aut(G), the automorphism group of G.
It is the same terminology used here, for instance: http://oeis.org/A001187 In this terminology, an unlabeled graph is a "graph up to isomorphism". Nathann -- 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 [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/d/optout.
