# HG changeset patch
# User Nathann Cohen <nathann.cohen@gmail.com>
# Date 1290586657 -3600
# Node ID 298f330e4765433dbab265279d3dd78da4efe47e
# Parent  b5d85a06a41775ad34db4d0d07efae448b9372b6
trac 10310 - use is_regular instead of redefining it in the docstring of the Brinkmann graph generator, and adding a doctest to check the automorphism group

diff -r b5d85a06a417 -r 298f330e4765 sage/graphs/graph_generators.py
--- a/sage/graphs/graph_generators.py	Mon Nov 22 10:10:20 2010 -0800
+++ b/sage/graphs/graph_generators.py	Wed Nov 24 09:17:37 2010 +0100
@@ -2158,10 +2158,7 @@
             21
             sage: G.size()
             42
-            sage: def is_4regular(G):
-            ...       D = G.degree_sequence()
-            ...       return all(d == 4 for d in D)
-            sage: is_4regular(G)
+            sage: G.is_regular(4)
             True
 
         It is an Eulerian graph with radius 3, diameter 3, and girth 5. ::
@@ -2181,6 +2178,12 @@
             True
             sage: G.chromatic_number()
             4
+
+        Its automorphism group is isomorphic to `D_7`::
+
+            sage: ag = G.automorphism_group()
+            sage: ag.is_isomorphic(DihedralGroup(7))
+            True
         """
         edge_dict = {
             0: [2,5,7,13],