The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-walks in graphs. We search for a shortest closed route visiting k cities in a non complete graph without weights. This motivates the following definition. Given a set of k distinct vertices S = {x1, x2, . . . , xk} in a simple graph G, the closed k-stop-distance of set S is defined to be dk(S) = min θ∈P(S) ( d(θ(x1), θ(x2))+d(θ(x2), θ(x3))+· · ·+d(θ(xk), θ(x1)) )