Abstract:
Domination theory is a part of Graph theory is used for finding communities in networks, device
for modeling, description of real world network systems such are : Transport, Water, Electricity, Internet
and many more. So using the domination theory and it is mixed with operation research techniques we can
try to solve short rout problem. In this paper we can try to find the shortest distance between two vertices
using the concept of minimal dominating set mechanism
