Detour Domination Number of More Graphs

Abstract

Let G = (V, E) be any graph.  For a subset  we define a detour dominating set of G if  is a detour and dominating set of G.  In this paper we find the detour domination number of some special graphs , Middle graphs and Inflated graphs.  Also we characterize graphs with particular values for detour domination numbers.