Solving the single step graph searching problem by solving the maximum two-independent set problem

Abstract The problem of single step searching a graph is investigated. We show that this problem can be solved by solving the maximum two-independent set problem. Results about solving the single step graph searching problem on special graphs are listed.