2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/32315Rule k is a localized approximation algorithm that finds a small connected dominating set in a graph. We estimate the expected size of the Rule k dominating set for the model of random unit disk graphs constructed from n random points in an s_n by s_n square region of the plane.Discrete Mathematicstext