diff --git a/python/cugraph/cugraph/tests/sampling/test_random_walks_mg.py b/python/cugraph/cugraph/tests/sampling/test_random_walks_mg.py
index 70a7556eef6..34eeb2902f8 100644
--- a/python/cugraph/cugraph/tests/sampling/test_random_walks_mg.py
+++ b/python/cugraph/cugraph/tests/sampling/test_random_walks_mg.py
@@ -218,6 +218,4 @@ def test_dask_mg_random_walks(dask_client, input_graph):
     df["dst"] = dest_col
     df["value"] = value_col
 
-    df_G = df
-
-    check_random_walks(input_graph, path_data, seeds, max_depth, df_G)
+    check_random_walks(input_graph, path_data, seeds, max_depth, df)
diff --git a/python/cugraph/cugraph/tests/sampling/test_uniform_neighbor_sample.py b/python/cugraph/cugraph/tests/sampling/test_uniform_neighbor_sample.py
index bf639f0d8bc..ad0dbe77f7d 100644
--- a/python/cugraph/cugraph/tests/sampling/test_uniform_neighbor_sample.py
+++ b/python/cugraph/cugraph/tests/sampling/test_uniform_neighbor_sample.py
@@ -250,6 +250,9 @@ def test_uniform_neighbor_sample_tree(directed):
         G.edgelist.edgelist_df, "src", "dst", "weights", symmetrize=not G.is_directed()
     )
 
+    # Retrieve the input dataframe.
+    # input_df != df if 'directed = False' because df will be symmetrized
+    # internally.
     input_df = cudf.DataFrame()
     input_df["src"] = source_col
     input_df["dst"] = dest_col
@@ -265,11 +268,6 @@ def test_uniform_neighbor_sample_tree(directed):
 
     assert G.renumbered is False
 
-    # Retrieve the input dataframe.
-    # input_df != df if 'directed = False' because df will be symmetrized
-    # internally.
-    # input_df = G.edgelist.edgelist_df
-
     # TODO: Incomplete, include more testing for tree graph as well as
     # for larger graphs
     start_list = cudf.Series([0, 0], dtype="int32")