diff --git a/python/cugraph/cugraph/dask/traversal/bfs.py b/python/cugraph/cugraph/dask/traversal/bfs.py
index c7b847b4457..6a8f0933cfb 100644
--- a/python/cugraph/cugraph/dask/traversal/bfs.py
+++ b/python/cugraph/cugraph/dask/traversal/bfs.py
@@ -98,12 +98,14 @@ def bfs(input_graph,
     ----------
     input_graph : cugraph.Graph
         cuGraph graph instance, should contain the connectivity information
-        as dask cudf edge list dataframe(edge weights are not used for this
+        as dask cudf edge list dataframe (edge weights are not used for this
         algorithm).
 
-    start : Integer
-        Specify starting vertex for breadth-first search; this function
-        iterates over edges in the component reachable from this node.
+    start : Integer or list
+        The id of the graph vertex from which the traversal begins, or
+        if a list, the vertex from which the traversal begins in each
+        component of the graph.  Only one vertex per connected
+        component of the graph is allowed.
 
     depth_limit : Integer or None, optional (default=None)
         Limit the depth of the search
diff --git a/python/cugraph/cugraph/traversal/bfs.py b/python/cugraph/cugraph/traversal/bfs.py
index 77fa02cad76..547c76dded3 100644
--- a/python/cugraph/cugraph/traversal/bfs.py
+++ b/python/cugraph/cugraph/traversal/bfs.py
@@ -183,8 +183,11 @@ def bfs(G,
         information. Edge weights, if present, should be single or double
         precision floating point values.
 
-    start : Integer, optional (default=None)
-        The index of the graph vertex from which the traversal begins
+    start : Integer or list, optional (default=None)
+        The id of the graph vertex from which the traversal begins, or
+        if a list, the vertex from which the traversal begins in each
+        component of the graph.  Only one vertex per connected
+        component of the graph is allowed.
 
     depth_limit : Integer or None, optional (default=None)
         Limit the depth of the search