#13721: Additional tests for graph symmetries and an improvement of
is_vertex_transitive
----------------------------------+-----------------------------------------
Reporter: azi | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-5.6
Component: graph theory | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: Jernej Azarija | Merged in:
Dependencies: | Stopgaps:
----------------------------------+-----------------------------------------
Comment (by ncohen):
Hellooooooooooooo !! Well, now it's my turn to try your patience `^^;`
I'm sorry that I did not notice it earlier, but there's something I do not
like inside the `is_eulerian` function. It does not just test that all
degrees are even, but also that the graph is connected. Because if your
graph is the union of two cycles, "then there is no tour that visits all
edges" `:-/`
So I guess that you will have to replace your call to is_eulerian by :
`all(d%2 == 0 for d in self.degree())`
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13721#comment:29>
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.
