#18997: Unitary and symplectic (dual) polar graphs
-------------------------+-------------------------------------------------
Reporter: | Owner:
dimpase | Status: needs_review
Type: | Milestone: sage-6.9
enhancement | Resolution:
Priority: major | Merged in:
Component: graph | Reviewers:
theory | Work issues:
Keywords: | Commit:
Authors: | ab18d25ae8046bb3091b7741ca930f60100b807e
Report Upstream: N/A | Stopgaps:
Branch: |
u/dimpase/unitary |
Dependencies: |
#18972 |
-------------------------+-------------------------------------------------
Comment (by jhpalmieri):
Does this help (maybe the changes for `_polar_Graph` are unnecessary):
{{{
#!diff
diff --git a/src/sage/graphs/generators/families.py
b/src/sage/graphs/generators/families.py
index 0fadbbd..89777b0 100644
--- a/src/sage/graphs/generators/families.py
+++ b/src/sage/graphs/generators/families.py
@@ -2535,11 +2535,11 @@ def _polar_Graph(m, q, g, intersection_size=None):
TESTS::
- sage: from sage.graphs.generators.families import _polar_Graph
- sage: _polar_Graph(4, 4, libgap.GeneralUnitaryGroup(4, 2))
- Graph on 45 vertices
- sage: _polar_Graph(4, 4, libgap.GeneralUnitaryGroup(4, 2),
intersection_size=1)
- Graph on 27 vertices
+ sage: from sage.graphs.generators.families import _polar_Graph
+ sage: _polar_Graph(4, 4, libgap.GeneralUnitaryGroup(4, 2))
+ Graph on 45 vertices
+ sage: _polar_Graph(4, 4, libgap.GeneralUnitaryGroup(4, 2),
intersection_size=1)
+ Graph on 27 vertices
"""
from sage.libs.gap.libgap import libgap
from itertools import combinations
@@ -2675,17 +2675,17 @@ def SymplecticDualPolarGraph(m, q):
EXAMPLES::
- sage: G = graphs.SymplecticDualPolarGraph(6,2); G
- Symplectic Polar Graph O(6, 2): Graph on 135 vertices
- sage: G.is_distance_regular(parameters=True)
- ([14, 12, 8, None], [None, 1, 3, 7])
+ sage: G = graphs.SymplecticDualPolarGraph(6,2); G
+ Symplectic Polar Graph O(6, 2): Graph on 135 vertices
+ sage: G.is_distance_regular(parameters=True)
+ ([14, 12, 8, None], [None, 1, 3, 7])
TESTS::
- sage: G = graphs.SymplecticDualPolarGraph(6,3); G # long time
- Symplectic Polar Graph O(6, 3): Graph on 1120 vertices
- sage: G.is_distance_regular(parameters=True) # long time
- ([39, 36, 27, None], [None, 1, 4, 13])
+ sage: G = graphs.SymplecticDualPolarGraph(6,3); G # long
time
+ Symplectic Polar Graph O(6, 3): Graph on 1120 vertices
+ sage: G.is_distance_regular(parameters=True) # long
time
+ ([39, 36, 27, None], [None, 1, 4, 13])
"""
from sage.libs.gap.libgap import libgap
G = _polar_Graph(m, q, libgap.SymplecticGroup(m, q),
}}}
If you feel like fixing some other minor docstring issues, you could make
these changes, too:
{{{
#!diff
diff --git a/src/sage/graphs/generators/families.py
b/src/sage/graphs/generators/families.py
index 0fadbbd..953b576 100644
--- a/src/sage/graphs/generators/families.py
+++ b/src/sage/graphs/generators/families.py
@@ -192,9 +192,9 @@ def BalancedTree(r, h):
TESTS:
- Normally we would only consider balanced trees whose root node
- has degree `r \geq 2`, but the construction degenerates
- gracefully::
+ Normally we would only consider balanced trees whose root node
+ has degree `r \geq 2`, but the construction degenerates
+ gracefully::
sage: graphs.BalancedTree(1, 10)
Balanced tree: Graph on 2 vertices
diff --git a/src/sage/graphs/generators/random.py
b/src/sage/graphs/generators/random.py
index 01f9c13..246250d 100644
--- a/src/sage/graphs/generators/random.py
+++ b/src/sage/graphs/generators/random.py
@@ -749,7 +749,7 @@ def RandomToleranceGraph(n):
sage: g.clique_number() == g.chromatic_number()
True
- TEST:
+ TEST::
sage: g = graphs.RandomToleranceGraph(-2)
Traceback (most recent call last):
diff --git a/src/sage/graphs/generators/smallgraphs.py
b/src/sage/graphs/generators/smallgraphs.py
index 39ca04e..27e1124 100644
--- a/src/sage/graphs/generators/smallgraphs.py
+++ b/src/sage/graphs/generators/smallgraphs.py
@@ -1810,7 +1810,7 @@ def ChvatalGraph():
2
4
- TEST:
+ TEST::
sage: import networkx
sage: G = graphs.ChvatalGraph()
@@ -2647,7 +2647,7 @@ def FruchtGraph():
'KhCKM?_EGK?L'
sage: (graphs.FruchtGraph()).show() # long time
- TEST:
+ TEST::
sage: import networkx
sage: G = graphs.FruchtGraph()
@@ -2896,7 +2896,7 @@ def HeawoodGraph():
'MhEGHC@AI?_PC@_G_'
sage: (graphs.HeawoodGraph()).show() # long time
- TEST:
+ TEST::
sage: import networkx
sage: G = graphs.HeawoodGraph()
@@ -3363,7 +3363,7 @@ def KrackhardtKiteGraph():
sage: g = graphs.KrackhardtKiteGraph()
sage: g.show() # long time
- TEST:
+ TEST::
sage: import networkx
sage: G = graphs.KrackhardtKiteGraph()
diff --git a/src/sage/graphs/strongly_regular_db.pyx
b/src/sage/graphs/strongly_regular_db.pyx
index 44a6640..f28248c 100644
--- a/src/sage/graphs/strongly_regular_db.pyx
+++ b/src/sage/graphs/strongly_regular_db.pyx
@@ -1518,7 +1518,7 @@ def strongly_regular_graph(int v,int k,int l,int
mu=-1,bint existence=False):
...
RuntimeError: Sage cannot figure out if a
(1394,175,0,25)-strongly regular graph exists.
- Test the Claw bound (see 3.D of [vLintBrouwer84]_):
+ Test the Claw bound (see 3.D of [vLintBrouwer84]_)::
sage:
graphs.strongly_regular_graph(2058,242,91,20,existence=True)
False
}}}
You could also change "TEST:" to "TESTS:" throughout, but I don't really
care much about that.
--
Ticket URL: <http://trac.sagemath.org/ticket/18997#comment:16>
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 unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
