# Ticket #10781: trac_10781-reviewer.patch

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

```# HG changeset patch
# User Nathann Cohen <nathann.cohen@gmail.com>
# Date 1299590088 -3600
# Node ID 7c3d566411e2dc69f5ff9f9c56d67b5570769f27
# Parent  3a67c2a91eeb21a93364f7caa9e8fe7945d4def6
#10781 - Shrikhande graph to the common graphs database (reviewer patch)

diff -r 3a67c2a91eeb -r 7c3d566411e2 sage/graphs/graph_generators.py```
 a """ Returns the Shrikhande graph. For more information, see `this MathWorld article on the Shrikhande graph `_ or `this Wikipedia article `_. For more information, see `this MathWorld article on the Shrikhande graph `_ or `this Wikipedia article `_. EXAMPLES: The Shrikhande graph was defined by S. S. Shrikhande in 1959. It has 16 vertices and 48 edges, and is strongly regular of degree 6 with parameters (2,2):: The Shrikhande graph was defined by S. S. Shrikhande in 1959. It has `16` vertices and `48` edges, and is strongly regular of degree `6` with parameters `(2,2)`:: sage: G = graphs.ShrikhandeGraph(); G Shrikhande graph: Graph on 16 vertices 48 sage: G.is_regular(6) True sage: set([len([x for x in G.neighbors(i) if x in G.neighbors(j)]) for i in range(G.order()) for j in range(i)]) sage: set([len([x for x in G.neighbors(i) if x in G.neighbors(j)]) ...         for i in range(G.order()) ...         for j in range(i)]) set([2]) It is non-planar, and both Hamiltonian and Eulerian:: sage: G.is_eulerian() True It has radius 2, diameter 2, and girth 3:: It has radius `2`, diameter `2`, and girth `3`:: sage: G.radius() 2 sage: G.girth() 3 Its chromatic number is 4 and its automorphism group is of order 192:: Its chromatic number is `4` and its automorphism group is of order `192`:: sage: G.chromatic_number() 4