Disjunctive Total Domination of Some Shadow Distance Graphs

Abstract

Let G be a graph having vertex set V(G). For S ⊆V(G), if each vertex is adjacent to a vertexin S or has at least two vertices in S at distance two from it, then the set S is a disjunctive totaldominating set of G. The disjunctive total domination number is the minimum cardinalityof such a set. In this work, we discuss the disjunctive total domination of shadow distancegraphs of some graphs such as cycle, path, star, complete bipartite and wheel graphs.