Estimation of the domination number in sparse random graphs and applications

Abstract

Motivated by airborne intruder detection and defence systems, we examine sparse random graphs with linear number of connections. We establish theoretical bounds on domination number and our analysis gives a partial solution of the problem posed in [6]. Our computer simulations are based on the integer linear programming optimization method. The experimental results verify our analytical estimations and suggest a direction for the future research.