*Department of Mathematics, Gandhigram Rural Institute-Deemed University, Gandhigram
**Research Scholar, Department of Mathematics, Gandhigram Rural Institute-Deemed University, Gandhigram
***Department of General Requirements, College of Applied Sciences, Ibri, Sultanate of Oman
The concept of extended medium domination number of a graph was introduced by Mahadevan et.al.in [9], which has lot of application in computer communication networks. Let G = (V, E) be a simple connected graph. edom(u, v) is the sum of number of u-v paths of length one, two and three. The total number of vertices that dominate every pair of vertices for . In any simple graph G of p number of vertices, the extended medium domination number of G is defined as . In this paper, we investigate this number for some special types of trees and product graphs.
Extended medium domination number
