diff --git a/docs/open-source/graph_memory/overview.mdx b/docs/open-source/graph_memory/overview.mdx
index 5a2c4214..1912729e 100644
--- a/docs/open-source/graph_memory/overview.mdx
+++ b/docs/open-source/graph_memory/overview.mdx
@@ -278,7 +278,7 @@ m.search("What is my name?", user_id="alice123")
 
 Below graph visualization shows what nodes and relationships are fetched from the graph for the provided query.
 
-![Graph Memory Visualization](../images/graph_memory/graph_example8.png)
+![Graph Memory Visualization](/images/graph_memory/graph_example8.png)
 
 <CodeGroup>
 ```python Code
@@ -295,7 +295,7 @@ m.search("Who is spiderman?", user_id="alice123")
 ```
 </CodeGroup>
 
-![Graph Memory Visualization](../images/graph_memory/graph_example9.png)
+![Graph Memory Visualization](/images/graph_memory/graph_example9.png)
 
 > **Note:** The Graph Memory implementation is not standalone. You will be adding/retrieving memories to the vector store and the graph store simultaneously.