Double domination number of the shadow (2,3)-distance graphs

Abstract

Let G (V,E) be a graph with the vertex set V (G) and S be a subset of V(G). If every vertex of V is dominated by S at least twice, then the set S is called a double domination set of the graph. The number of elements of the double domination set with the smallest cardinality is called double domination number and denoted by 2 (G)  notation. In this paper, we discussed the double domination parameter on some types of shadow distance graphs such as cycle, path, star, complete bipartite and wheel graphs.