diff --git a/Documentation/Books/Manual/Graphs/README.md b/Documentation/Books/Manual/Graphs/README.md
index 43c57c53b6..063fb40c9b 100644
--- a/Documentation/Books/Manual/Graphs/README.md
+++ b/Documentation/Books/Manual/Graphs/README.md
@@ -79,7 +79,7 @@ i.e. `"friends"`, `"family"`, `"married"` or `"workmates"`, so you can later `FI
 if you only want to follow the friend edges.
 
 Another way, which may be more efficient in some cases, is to use different edge collections for different
-types of edges, so you have `friend_eges`, `family_edges`, `married_edges` and `workmate_edges` as collection names.
+types of edges, so you have `friend_edges`, `family_edges`, `married_edges` and `workmate_edges` as collection names.
 You can then configure several named graphs including a subset of the available edge and vertex collections -
 or you use anonymous graph queries, where you specify a list of edge collections to take into account in that query.
 To only follow friend edges, you would specify `friend_edges` as sole edge collection.