2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/231137Motivated by applications of Gabriel graphs and Yao graphs in wireless ad-hoc networks, we show that the maximal degree of a random Gabriel graph or Yao graph defined on $n$ points drawn uniformly at random from a unit square grows as $Θ(\log n / \log \log n)$ in probability.20 pages, 10 figuresComputational GeometryDistributed, Parallel, and Cluster ComputingI.3.5; E.1text