Search in Medwell
 
 
Journal of Engineering and Applied Sciences
Year: 2018 | Volume: 13 | Issue: 11 SI | Page No.: 8843-8846
DOI: 10.36478/jeasci.2018.8843.8846  
Extended Medium Domination Number of a Jahangir Graph
G. Mahadevan and V. Vijayalakshmi
 
Abstract: The medium domination number of a Jahangir graph Jm,n was introduced by M. Ramachandran and N. Parvathi. Recently Mahadevan et al., introduced the concept of extended medium domination number of a graph. edom (u, v) is the sum of number of u-v paths of length less than or equal to 3. ETDV (G) = Σedom (u, v) for u, vεV(G) is the total number of vertices that dominate every pair of vertices. The extended medium domination number of G is EMD(G) = ETDV(G)/(p2) where, p is the number of vertices in G. Here, we generalize the extended medium domination number of Jahangir graph, sunflower graph and windmill graph.
 
How to cite this article:
G. Mahadevan and V. Vijayalakshmi, 2018. Extended Medium Domination Number of a Jahangir Graph. Journal of Engineering and Applied Sciences, 13: 8843-8846.
DOI: 10.36478/jeasci.2018.8843.8846
URL: http://medwelljournals.com/abstract/?doi=jeasci.2018.8843.8846