Hamiltonicity for convex shape Delaunay and Gabriel graphs

Abstract We study Hamiltonicity for some of the most general variants of Delaunay and Gabriel graphs. Instead of defining these proximity graphs using circles, we use an arbitrary convex shape C . Let S be a point set in the plane. The k-order Delaunay graph of S, denoted k- D G C ( S ) , has vertex set S, and edges defined as follows. Given p , q ∈ S , pq is an edge of k- D G C ( S ) provided there exists some homothet of C with p and q on its boundary and containing at most k points of S different from p and q. The k-order Gabriel graph, denoted k- G G C ( S ) , is defined analogously, except that the homothets considered are restricted to be smallest homothets of C with p and q on the boundary. We provide upper bounds on the minimum value of k for which k- G G C ( S ) is Hamiltonian. Since k- G G C ( S ) ⊆ k- D G C ( S ) , all results carry over to k- D G C ( S ) . In particular, we give upper bounds of 24 for every C and 15 for every point-symmetric C . We also improve these bounds to 7 for squares, 11 for regular hexagons, 12 for regular octagons, and 11 for even-sided regular t-gons (for t ≥ 10 ) . These constitute the first general results on Hamiltonicity for convex shape Delaunay and Gabriel graphs. In addition, we show lower bounds of k = 3 and k = 6 on the existence of a bottleneck Hamiltonian cycle in the k-order Gabriel graph for squares and hexagons, respectively. Finally, we construct a point set such that for an infinite family of regular polygons P t , the Delaunay graph D G P t does not contain a Hamiltonian cycle.