Yes, your reasoning is correct to me.

For an infinite disconnected graph, the basic searching algorithms like BFS, DFS and so no will never terminate as the nodes will keep on expanding leading to never meeting failure condition.

In order to make these algorithms trigger the failure condition, you need to add another condition that detects the cycling of search or if the depth or cost is above the specified one.

This modification may help the infinite graphs to halt.