Relatively Prime Detour Domination Number of a Graph

Abstract

The concept of relatively prime detour domination number of a graph is introduced in this paper. If a set  is a detour dominating set with at least two members, and a pair of vertices  and  such that , it is said to be a relatively prime detour dominating set of . The lowest cardinality of a relatively prime detour dominating set in  is known as the relatively prime detour domination number and it is denoted by .