IJSR - International Journal of Scientific Research

N.Arianayagam; J.Vijaya Xavier Parthipan; M.P. Syed Ali Nisaya

Volume : VI, Issue : I, January - 2017

Detour Dominating Algorithm and Applications.

N. Arianayagam, J. Vijaya Xavier Parthipan, M. P. Syed Ali Nisaya

Abstract :

For vertices and in a connected graph , the detour distance is the length of the longest path in . A path of length is called a detour. The detour distance is a metric on the vertex set . Chart and et al introduced the concept of detour distance by considering the length of the longest path between the vertices and . The Detour set ,Dominating set and Detour Dominating set definition was given and used in image processing for image correction .Here the Detour, Dominating and Detour Dominating Algorithm was introduced and their applications are given.