#13067: is_strongly_regular
--------------------------------------------------------------------------------------------------+
Reporter: ncohen
| Owner: jason, ncohen, rlm
Type: enhancement
| Status: new
Priority: major
| Milestone: sage-5.1
Component: graph theory
| Resolution:
Keywords:
| Work issues:
Report Upstream: N/A
| Reviewers:
Authors:
| Merged in:
Dependencies: #12942, #12945, #12952, #12971, #12980, #12981, #12982,
#12989, #13038, #13058 | Stopgaps:
--------------------------------------------------------------------------------------------------+
Comment (by kini):
"Certificate" has a quite specific meaning. A certificate of a certain
property of an object is something which proves that the object has that
property. A list of odd cycles would prove that a graph is not bipartite,
and an explicit bipartition would prove that it is bipartite. A linear
extension would prove that a graph is a DAG, and a circuit would prove
that it is not a DAG. The triple you return is not in itself a proof of
anything.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13067#comment:4>
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.
