The Detour Domination and Connected Detour Domination values of a graph

Abstract

The number of -sets that belongs to in G is defined as the detour domination value of indicated by for each vertex . In this article, we examined at the concept of a graph’s detour domination value. The connected detour domination values of a vertex represented as , are defined as the number of -sets to which a vertex belongs to G. Some of the related detour dominating values in graphs’ general characteristics are examined. This concept’s satisfaction of some general properties is investigated. Some common graphs are established.

Keywords

• domination number
• detour number
• detour domination value
• connected detour domination value
• etc.