#10896: Strongly Regular Graph
----------------------------+-----------------------------------------------
Reporter: pgdx | Owner: jason, ncohen, rlm
Type: enhancement | Status: new
Priority: major | Milestone:
Component: graph theory | Keywords: srg strongly regular graph
Author: pgdx | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------+-----------------------------------------------
I have been missing a function/method in the Graph class that allows you
to test whether or not a graph is strongly regular.
A graph is strongly regular, or srg(n,k,l,m) if it is a regular graph on n
vertices with degree k, and every two adjacent vertices have l common
neighbours and every two non-adjacent vertices have m common neighbours.
Examples are PetersenGraph (10,3,0,1), the 5-Cycle (5,2,0,1), the
Shrikhande graph (16,6,2,2) with more. For information on strongly regular
graphs read on Wikipedia.
I have written a function, with documentation, that tests if a graph is
strongly regular. The functions have optional arguments:
n,k,l,m,certificate. More on this is to be found in the attached file.
The only thing that needs to be done is testing it and making it into a
method of Graph, instead of a function, i.e. remove "g" from its argument
list and rename all function calls g.* to this.*
Hope to see this path upstream as soon as possible.
I hereby give Sage community full copyright and other possible ownerships.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/10896>
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.
