The author establishes a lower bound for the secure domination number of outerplanar graphs, proving that it is at least (n + 4)/5 and demonstrating its tightness.
