Ticket #10790: trac_10790-reviewer.patch

File trac_10790-reviewer.patch, 2.7 KB (added by ncohen, 11 years ago)
  • sage/graphs/graph_generators.py

    # HG changeset patch
    # User Nathann Cohen <nathann.cohen@gmail.com>
    # Date 1299590262 -3600
    # Node ID 92426efbabeff550feb56e872e55a1f8810cb028
    # Parent  be06513f4722fd27c3f34798441d3bd35791eea3
    #10790 -  Dyck graph to the common graphs database (reviewer patch)
    
    diff -r be06513f4722 -r 92426efbabef sage/graphs/graph_generators.py
    a b  
    24352435        """
    24362436        Returns the Dyck graph.
    24372437
    2438         For more information, see `this MathWorld article on the Dyck graph <http://mathworld.wolfram.com/DyckGraph.html>`_ or `this
    2439         Wikipedia article <http://en.wikipedia.org/wiki/Dyck_graph>`_.
     2438        For more information, see `this MathWorld article on the Dyck graph
     2439        <http://mathworld.wolfram.com/DyckGraph.html>`_ or `this Wikipedia
     2440        article <http://en.wikipedia.org/wiki/Dyck_graph>`_.
    24402441
    24412442        EXAMPLES:
    24422443
    2443         The Dyck graph was defined by Walther von Dyck in 1881. It has 32 vertices and 48 edges, and is a cubic graph (regular of degree 3)::
     2444        The Dyck graph was defined by Walther von Dyck in 1881. It has `32`
     2445        vertices and `48` edges, and is a cubic graph (regular of degree `3`)::
    24442446           
    24452447            sage: G = graphs.DyckGraph(); G
    24462448            Dyck graph: Graph on 32 vertices
     
    24532455            sage: G.is_regular(3)
    24542456            True
    24552457
    2456         It is non-planar and Hamiltonian, as well as bipartite (making it a bicubic graph)::
     2458        It is non-planar and Hamiltonian, as well as bipartite (making it a
     2459        bicubic graph)::
    24572460           
    24582461            sage: G.is_planar()
    24592462            False
     
    24622465            sage: G.is_bipartite()
    24632466            True
    24642467
    2465         It has radius 5, diameter 5, and girth 6::
     2468        It has radius `5`, diameter `5`, and girth `6`::
    24662469           
    24672470            sage: G.radius()
    24682471            5
     
    24712474            sage: G.girth()
    24722475            6
    24732476
    2474         Its chromatic number is 2 and its automorphism group is of order 192::
     2477        Its chromatic number is `2` and its automorphism group is of order
     2478        `192`::
    24752479           
    24762480            sage: G.chromatic_number()
    24772481            2
     
    24842488            (x - 3) * (x + 3) * (x - 1)^9 * (x + 1)^9 * (x^2 - 5)^6
    24852489
    24862490        It is a toroidal graph, and its embedding on a torus is dual to an
    2487         embedding of the Shrikhande graph (:meth:`ShrikhandeGraph <GraphGenerators.ShrikhandeGraph>`).
     2491        embedding of the Shrikhande graph (:meth:`ShrikhandeGraph
     2492        <GraphGenerators.ShrikhandeGraph>`).
    24882493        """
    24892494        pos_dict = {}
    24902495        for i in range(8):