On minimum walks in graphs

In this paper homomorphisms are used to define four new parameters of a graph, which have to do with minimum walks in graphs satisfying certain conditions. Several bounds and exact equations are obtained for two of these parameters; a third parameter is seen to be closely related to the Traveling Salesman Problem and the question of whether a given graph is Hamiltonian.