Enforced Hamiltonian Cycles in Distance Graphs

Abstract

The H-force number of a hamiltonian graph G is the smallest number k with the property that there exists a set W ⊆ V (G), |W | = k, such that each cycle passing through all vertices of W is hamiltonian. In this paper, we determine the H-force numbers of distance graphs with two parameters.