fixed typos and refs, updated for the current beta

sagemath · Nov 11, 2016 · edfeed1 · edfeed1
1 parent 116abf9
commit edfeed1
Show file tree

Hide file tree

Showing 3 changed files with 6 additions and 4 deletions.
diff --git a/src/sage/combinat/matrices/hadamard_matrix.py b/src/sage/combinat/matrices/hadamard_matrix.py
@@ -728,7 +728,8 @@ def RSHCD_324(e):
 
     .. [CP16] \N. Cohen, D. Pasechnik,
        Implementing Brouwer's database of strongly regular graphs,
-       http://arxiv.org/abs/1601.00181
+       Designs, Codes, and Cryptography, 2016
+       :doi:`10.1007/s10623-016-0264-x`
     """
 
     from sage.graphs.generators.smallgraphs import JankoKharaghaniTonchevGraph as JKTG

diff --git a/src/sage/graphs/generators/smallgraphs.py b/src/sage/graphs/generators/smallgraphs.py
@@ -5085,7 +5085,7 @@ def IoninKharaghani765Graph():
         zero matrix of order 45, and every off-diagonal entry `\omega^k` by the
         matrix `N(\sigma^k(X_1, X_2, X_3, X_4, X_5))` (through the association
         of `\omega^k` with an element of `G`). Then `S` is a symmetric incidence
-        matrix of a symmetric `(765, 192, 48)`-design with zer diagonal, and
+        matrix of a symmetric `(765, 192, 48)`-design with zero diagonal, and
         therefore `S` is an adjacency matrix of a strongly regular graph with
         parameters `(765, 192, 48, 48)`.
 
@@ -5110,7 +5110,7 @@ def IoninKharaghani765Graph():
        New families of strongly regular graphs.
        Journal of Combinatorial Designs,
        Vol 11 (2003), no. 3, 208–217,
-       http://doi.org/10.1002/jcd.10038
+       :doi:`10.1002/jcd.10038`
     """
     from sage.rings.finite_rings.finite_field_constructor import FiniteField as GF
     K = GF(3)

diff --git a/src/sage/graphs/strongly_regular_db.pyx b/src/sage/graphs/strongly_regular_db.pyx
@@ -11,6 +11,7 @@ Using Andries Brouwer's `database of strongly regular graphs
 non-existence results. Note that some constructions are missing, and that some
 strongly regular graphs that exist in the database cannot be automatically built
 by Sage. Help us if you know any.
+An outline of the implementation can be found in [CP16]_.
 
 .. NOTE::
 
@@ -20,7 +21,7 @@ by Sage. Help us if you know any.
 
 REFERENCES:
 
-.. [BvL84] \A. Brouwer, J van Lint,
+.. [BvL84] \A. Brouwer, J. van Lint,
    Strongly regular graphs and partial geometries,
    Enumeration and design,
    (Waterloo, Ont., 1982) (1984): 85-122.