From f1cb6a14854fc0c16a1ffa688882c5a0e4a8b227 Mon Sep 17 00:00:00 2001
From: Marina Anagnostopoulou-Merkouri <mam49@st-andrews.ac.uk>
Date: Wed, 26 May 2021 16:57:48 +0300
Subject: [PATCH] fixed capitalisation in pancake graph and number of edges in
 burnt pancake

---
 doc/examples.xml | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/doc/examples.xml b/doc/examples.xml
index 151af26bb..4c81aca11 100644
--- a/doc/examples.xml
+++ b/doc/examples.xml
@@ -500,8 +500,8 @@ gap> TriangularGridGraph(IsMutable, 3, 3);
   <Returns>A digraph.</Returns>
   <Description>
     If <A>n</A> is a positive integer, then this operation returns
-    the <E>Pancake graph</E> with <M>n!</M> vertices and <M>n!(n - 1)</M>
-    directed edges. The <M>n</M>th Pancake graph is the Cayley graph of the
+    the <E>pancake graph</E> with <M>n!</M> vertices and <M>n!(n - 1)</M>
+    directed edges. The <M>n</M>th pancake graph is the Cayley graph of the
     symmetric group acting on <C>[1 .. <A>n</A>]</C> with respect to the
     generating set consisting of the <Q>prefix reversals</Q>. This generating
     set consists of the permutations <C>p2</C>, <C>p3</C>, ...,
@@ -539,8 +539,8 @@ true]]></Example>
   <Returns>A digraph.</Returns>
   <Description>
     If <A>n</A> is a positive integer, then this operation returns
-    the <E>burnt pancake graph</E> with <M>n!</M> vertices and <M>n!(n - 1)</M>
-    directed edges. The <M>n</M>th Pancake graph is the Cayley graph of the
+    the <E>burnt pancake graph</E> with <M>n!</M> vertices and <M>n2^(n)n!</M>
+    directed edges. The <M>n</M>th burnt pancake graph is the Cayley graph of the
     hyperoctahedral group acting on <C>[<A>-n</A> .. -1, 1 .. <A>n</A>]</C> with respect to the
     generating set consisting of the <Q>prefix reversals</Q>, which are defined in exactly
     the same way as in  <Ref Oper="PancakeGraph"/>. The hyperoctahedral group consists of