diff --git a/doc/exmpl.xml b/doc/exmpl.xml
index 3ccb32cd4..8ab4dbeb0 100644
--- a/doc/exmpl.xml
+++ b/doc/exmpl.xml
@@ -16,7 +16,9 @@
 
     From Wikipedia: The Petersen graph is an undirected graph with 10 vertices and 15 edges. It is a small graph that serves as a useful example and counterexample for many problems in graph theory. The Petersen graph is named after Julius Petersen, who in 1898 constructed it to be the smallest bridgeless cubic graph with no three-edge-coloring.<P/>
 
-    For more information, see <URL>https://en.wikipedia.org/wiki/Petersen_graph</URL>
+    For more information, see <URL>https://en.wikipedia.org/wiki/Petersen_graph</URL><P/>
+
+    See also <Ref Func="GeneralisedPetersenGraph"/>.
 
 <Example><![CDATA[
 gap> ChromaticNumber(PetersenGraph());
@@ -26,6 +28,35 @@ gap> ChromaticNumber(PetersenGraph());
 </ManSection>
 <#/GAPDoc>
 
+<#GAPDoc Label="GeneralisedPetersenGraph">
+<ManSection>
+  <Attr Name="GeneralisedPetersenGraph" Arg="n, k"/>
+  <Returns>A digraph.</Returns>
+  <Description>
+    If <A>n</A> is a positive integer and <A>k</A> is a non-negative integer less than <A>n / 2</A>, then this operation returns the <E>Generalised Petersen Graph</E> <M>GPG(n, k)</M>. <P/>
+
+    From Wikipedia: The generalized Petersen graphs are a family of cubic graphs formed by connecting the vertices of a regular polygon to the corresponding vertices of a star polygon. They include the Petersen graph and generalize one of the ways of constructing the Petersen graph. The generalized Petersen graph family was introduced in 1950 by H. S. M. Coxeter and was given its name in 1969 by Mark Watkins.<P/>
+
+    For more information, see <URL>https://en.wikipedia.org/wiki/Generalized_Petersen_graph</URL><P/>
+
+    See also <Ref Func="PetersenGraph"/>.
+
+<Example><![CDATA[
+gap> GeneralisedPetersenGraph(7, 2);
+<immutable digraph with 14 vertices, 42 edges>
+gap> GeneralisedPetersenGraph(40, 1);
+<immutable digraph with 80 vertices, 240 edges>
+gap> D := GeneralisedPetersenGraph(5, 2);
+<immutable digraph with 10 vertices, 30 edges>
+gap> IsIsomorphicDigraph(D, PetersenGraph());
+true
+gap> GeneralisedPetersenGraph(IsMutableDigraph, 9, 4);
+<mutable digraph with 18 vertices, 54 edges>
+]]></Example>
+  </Description>
+</ManSection>
+<#/GAPDoc>
+
 <#GAPDoc Label="JohnsonDigraph">
 <ManSection>
   <Oper Name="JohnsonDigraph" Arg="n, k"/>
diff --git a/doc/z-chap2.xml b/doc/z-chap2.xml
index aada4b3ee..bddba5250 100644
--- a/doc/z-chap2.xml
+++ b/doc/z-chap2.xml
@@ -77,6 +77,7 @@
     <#Include Label="EmptyDigraph">
     <#Include Label="JohnsonDigraph">
     <#Include Label="PetersenGraph">
+    <#Include Label="GeneralisedPetersenGraph">
   </Section>
 
 </Chapter>
diff --git a/gap/exmpl.gd b/gap/exmpl.gd
index 0db489a19..3aa7277a8 100644
--- a/gap/exmpl.gd
+++ b/gap/exmpl.gd
@@ -44,3 +44,7 @@ DeclareOperation("JohnsonDigraph", [IsFunction, IsInt, IsInt]);
 DeclareConstructor("PetersenGraphCons", [IsDigraph]);
 DeclareOperation("PetersenGraph", []);
 DeclareOperation("PetersenGraph", [IsFunction]);
+
+DeclareConstructor("GeneralisedPetersenGraphCons", [IsDigraph, IsInt, IsInt]);
+DeclareOperation("GeneralisedPetersenGraph", [IsInt, IsInt]);
+DeclareOperation("GeneralisedPetersenGraph", [IsFunction, IsInt, IsInt]);
diff --git a/gap/exmpl.gi b/gap/exmpl.gi
index ff98ab55d..98f10a7f2 100644
--- a/gap/exmpl.gi
+++ b/gap/exmpl.gi
@@ -356,3 +356,59 @@ InstallMethod(PetersenGraph, [],
 function()
   return PetersenGraphCons(IsImmutableDigraph);
 end);
+
+InstallMethod(GeneralisedPetersenGraphCons,
+"for IsMutableDigraph, integer, integer",
+[IsMutableDigraph, IsInt, IsInt],
+function(filt, n, k)
+  local D, i;
+  if n < 1 then
+    ErrorNoReturn("the argument <n> must be a positive integer,");
+  elif k < 0 then
+    ErrorNoReturn("the argument <k> must be a non-negative integer,");
+  elif k > n / 2 then
+    ErrorNoReturn("the argument <k> must be less than <n> / 2,");
+  fi;
+  D := Digraph(filt, []);
+  for i in [1 .. 2 * n] do
+    DigraphAddVertex(D, i);
+  od;
+  for i in [1 .. n] do
+    if i <> n then
+      DigraphAddEdge(D, [i, i + 1]);
+    else
+      DigraphAddEdge(D, [n, 1]);
+    fi;
+    DigraphAddEdge(D, [i, n + i]);
+    if n + i + k <= 2 * n then
+      DigraphAddEdge(D, [n + i, n + i + k]);
+    else
+      DigraphAddEdge(D, [n + i, ((n + i + k) mod n) + n]);
+    fi;
+    od;
+    DigraphSymmetricClosure(D);
+  return D;
+end);
+
+InstallMethod(GeneralisedPetersenGraphCons,
+"for IsImmutableDigraph, integer, int",
+[IsImmutableDigraph, IsInt, IsInt],
+function(filt, n, k)
+  local D;
+  D := MakeImmutableDigraph(GeneralisedPetersenGraphCons(
+       IsMutableDigraph, n, k));
+  SetIsMultiDigraph(D, false);
+  SetIsSymmetricDigraph(D, true);
+  return D;
+end);
+
+InstallMethod(GeneralisedPetersenGraph, "for a function, integer, integer",
+[IsFunction, IsInt, IsInt],
+function(func, n, k)
+  return GeneralisedPetersenGraphCons(func, n, k);
+end);
+
+InstallMethod(GeneralisedPetersenGraph, "for integer, integer", [IsInt, IsInt],
+function(n, k)
+  return GeneralisedPetersenGraphCons(IsImmutableDigraph, n, k);
+end);
diff --git a/tst/standard/exmpl.tst b/tst/standard/exmpl.tst
index 57794f9d8..d86ad7845 100644
--- a/tst/standard/exmpl.tst
+++ b/tst/standard/exmpl.tst
@@ -21,6 +21,34 @@ gap> DigraphGirth(PetersenGraph());
 gap> PetersenGraph(IsMutableDigraph);
 <mutable digraph with 10 vertices, 30 edges>
 
+# GeneralisedPetersenGraph
+gap> D := GeneralisedPetersenGraph(8, 3);
+<immutable digraph with 16 vertices, 48 edges>
+gap> IsBipartiteDigraph(D);
+true
+gap> D := GeneralisedPetersenGraph(15, 7);
+<immutable digraph with 30 vertices, 90 edges>
+gap> IsBipartiteDigraph(D);
+false
+gap> D := GeneralisedPetersenGraph(10, 2);
+<immutable digraph with 20 vertices, 60 edges>
+gap> IsVertexTransitive(D);
+true
+gap> D := GeneralisedPetersenGraph(11, 2);
+<immutable digraph with 22 vertices, 66 edges>
+gap> IsVertexTransitive(D);
+false
+gap> D := GeneralisedPetersenGraph(5, 2);
+<immutable digraph with 10 vertices, 30 edges>
+gap> IsIsomorphicDigraph(D, PetersenGraph());
+true
+gap> G8_3 := DigraphFromGraph6String("OCQa`Q?OH?a@A@@?_OGB@");
+<immutable digraph with 16 vertices, 48 edges>
+gap> D := GeneralisedPetersenGraph(8, 3);
+<immutable digraph with 16 vertices, 48 edges>
+gap> IsIsomorphicDigraph(D, G8_3);
+true
+
 #  CompleteDigraph
 gap> gr := CompleteDigraph(5);
 <immutable digraph with 5 vertices, 20 edges>