#9702: Matching polynomials for graphs
------------------------------------------+---------------------------------
Reporter: rlm | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.6.1
Component: graph theory | Keywords:
Author: Tom Boothby, Robert Miller | Upstream: N/A
Reviewer: Nathann Cohen | Merged:
Work_issues: |
------------------------------------------+---------------------------------
Changes (by ncohen):
* reviewer: => Nathann Cohen
Comment:
Helloooooooo !!!
Well, it seemed fuxxy it my mind last time I had a look at it, and it may
have been because I was trying to understand how your data structure
worked.... Knowing this, I opened it again today and it seemed crystal
clear `:-)`
I changed nothing since the last version of my patch, short of a new
doctest in the method computing the polynomials of the complete graph,
using the formula given at
http://mathworld.wolfram.com/MatchingPolynomial.html
If anybody can review my patch, this ticket is good to go !
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/9702#comment:5>
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.
