Publication | Closed Access
Strong Connectivity in Directional Nearest-Neighbor Graphs
18
Citations
0
References
1981
Year
Directed GraphEngineeringGeometryPlanar GraphNetwork AnalysisEducationData ScienceStructural Graph TheoryDirectional Nearest-neighbor GraphStrong ConnectivityGraph DrawingDiscrete MathematicsComputational GeometrySocial Network AnalysisGeometric Graph TheoryTopological Graph TheoryNetwork ScienceGraph TheoryDirectional Nearest-neighbor GraphsNearest NeighborMetric Graph TheoryGraph Analysis
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.