Strong Connectivity in Directional Nearest-Neighbor Graphs

Authors:
  • BFB. E. Flinchbaugh
    B. E. Flinchbaugh
  • LJL. K. Jones
    L. K. Jones

Abstract
A Directional Nearest-Neighbor graph is defined on a finite set of points in the plane by drawing an arc from each point X to its nearest neighbor in each of r divisions of the plane relative to X. We prove that Directional Nearest-Neighbor graphs having $r = 4$ are strongly connected.