#10904: Certification of isomorphism of graphs
-----------------------------+----------------------------------------------
Reporter: aschilling | Owner: tbd
Type: defect | Status: new
Priority: major | Milestone:
Component: PLEASE CHANGE | Keywords: graphs
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
-----------------------------+----------------------------------------------
The output of the crystal isomorphism is currently different whether or
not one specifies edge_labels = True.
For example without edge_labels = True the result is a bijection between
the vertices of the graph:
{{{
sage: D = digraphs.RandomDirectedGNP(6, .2)
sage: D.is_isomorphic(D, certify = True)
(True, {0: 0, 1: 1, 2: 2, 3: 3, 4: 4, 5: 5})
}}}
If in addition one specifies edge_labels=True this changes to some
labeling of an extended digraph(?):
{{{
sage: D.is_isomorphic(D,edge_labels=True, certify = True)
{0: 0, 1: 1, 2: 2, 3: 3, 4: 4, 5: 5, 6: 6, 7: 7, 8: 8, 9: 9, 10: 10}
}}}
Would it be possible to make the output with edge_labels = True
consistent?
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/10904>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
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-trac?hl=en.
