Strong Connectivity in Directional Nearest-Neighbor Graphs
Authors:
- B. E. FlinchbaughBFB. E. Flinchbaugh
- L. K. JonesLJL. K. Jones
- 1 December 1981
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 2 (4) , 461-463
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.