On 8 juil, 16:05, Jeroen Demeyer <jdeme...@cage.ugent.be> wrote:
> On 2011-07-08 15:15, Vincent D wrote:
>
> > Actually, the problem is even worst... the function relabel does not
> > do the right job! The graph G2 obtained as above has two loops at the
> > vertex 4.
>
> Well, to what does to vertex 4 get mapped to under your "permutation"?
You're right... the problem is not worst. It is just as I said in my
first mail: we simply choose a renumbering
0 -> 4
1 -> 5
2 -> 3
3 -> 2
4 -> 1
5 -> 0
and get that the graph are not isomorphic.
{{{
...
sage: G2 = G1.relabel(perm={0:4, 1:5, 2:3, 3:2, 4:1, 5:0},
inplace=False)
sage: G1.is_isomorphic(G2,edge_labels=True)
False
}}}
(and I do not get (False, False) for the preceding command). I'm
almost sure that the problem only appears in a recent version of Sage.
I have a patch wich has no doctest error and now has that kind of
weirdness.
Thanks for your patience in that laborious bug report,
Vincent
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/sage-devel
URL: http://www.sagemath.org
