Volume :7 , Issue :4 ,Page :86-94

Abstract : The medium domination number was introduced by Vargor D and Dundar P to find the number of vertices which protect the pairs of vertic es in a graph. The total number of vertices that dominates all the pairs of vertices and evaluates the averages of this value is called medium domination number. In this chapter, we concen trate mainly to find the medium domination number of product of Path graphs such as Cardinal, Strong, Cartesian an d equivalent paths graphs. For basic concepts and medium domination number of some standard graphs one can refer to [1].